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/mapsum3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:27:16,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:16,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:16,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:16,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:16,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:16,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:16,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:16,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:16,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:16,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:16,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:16,697 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:16,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:16,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:16,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:16,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:16,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:16,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:16,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:16,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:16,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:16,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:16,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:16,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:16,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:16,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:16,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:16,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:16,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:16,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:16,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:16,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:16,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:16,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:16,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:16,720 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:16,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:16,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:16,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:16,742 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:16,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:16,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:16,743 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:16,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:16,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:16,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:27:16,747 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:16,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:16,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:16,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:16,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:16,748 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:16,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:16,748 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:16,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:16,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:16,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:16,750 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:16,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:16,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:16,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:16,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:16,751 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:16,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:27:16,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:16,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:27:16,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:27:16,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:16,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:16,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:16,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:16,831 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:16,832 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum3_true-unreach-call.i [2018-11-23 12:27:16,900 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5183fabe/2a161e3beace4f1ba9ca02e697d88c64/FLAGf72f3d6c1 [2018-11-23 12:27:17,378 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:17,378 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum3_true-unreach-call.i [2018-11-23 12:27:17,384 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5183fabe/2a161e3beace4f1ba9ca02e697d88c64/FLAGf72f3d6c1 [2018-11-23 12:27:17,725 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5183fabe/2a161e3beace4f1ba9ca02e697d88c64 [2018-11-23 12:27:17,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:17,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:17,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:17,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:17,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:17,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:17" (1/1) ... [2018-11-23 12:27:17,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4620f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:17, skipping insertion in model container [2018-11-23 12:27:17,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:17" (1/1) ... [2018-11-23 12:27:17,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:17,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:18,055 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:18,069 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:18,106 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:18,130 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:18,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:18 WrapperNode [2018-11-23 12:27:18,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:18,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:18,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:18,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:18,142 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:18" (1/1) ... [2018-11-23 12:27:18,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:18" (1/1) ... [2018-11-23 12:27:18,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:18,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:18,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:18,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:18,167 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:18" (1/1) ... [2018-11-23 12:27:18,167 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:18" (1/1) ... [2018-11-23 12:27:18,170 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:18" (1/1) ... [2018-11-23 12:27:18,170 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:18" (1/1) ... [2018-11-23 12:27:18,183 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:18" (1/1) ... [2018-11-23 12:27:18,189 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:18" (1/1) ... [2018-11-23 12:27:18,191 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:18" (1/1) ... [2018-11-23 12:27:18,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:18,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:18,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:18,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:18,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:18" (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:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:27:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2018-11-23 12:27:18,326 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2018-11-23 12:27:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:27:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:18,327 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:18,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:19,033 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:19,034 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:27:19,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:19 BoogieIcfgContainer [2018-11-23 12:27:19,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:19,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:19,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:19,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:19,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:17" (1/3) ... [2018-11-23 12:27:19,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616fb91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:19, skipping insertion in model container [2018-11-23 12:27:19,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:18" (2/3) ... [2018-11-23 12:27:19,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616fb91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:19, skipping insertion in model container [2018-11-23 12:27:19,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:19" (3/3) ... [2018-11-23 12:27:19,046 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum3_true-unreach-call.i [2018-11-23 12:27:19,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:19,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:19,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:19,120 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:19,121 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:19,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:19,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:19,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:19,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:19,122 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:19,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:19,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:27:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:19,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:19,149 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:19,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:19,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:27:19,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:19,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:27:19,382 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:19,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:19,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:27:19,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:27:19,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:27:19,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:27:19,391 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:19,392 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:19,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:19,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:19,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:19,393 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:27:19,394 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:19,394 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:19,394 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:19,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:19,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:19,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:19,395 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:27:19,396 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:19,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:27:19,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:19,397 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:27:19,397 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:19,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:27:19,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:27:19,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:19,399 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:27:19,399 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:19,399 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:19,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:27:19,406 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:19,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:19,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:19,415 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:19,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:19,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:27:19,636 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:19,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:19,647 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:27:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,770 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:27:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:19,772 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:19,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:27:20,053 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:20,065 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:20,065 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:27:20,069 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:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:27:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:27:20,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:20,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:20,119 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:20,119 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,125 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:20,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,127 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:20,127 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,132 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:20,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:20,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:27:20,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:27:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:20,140 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:27:20,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:20,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:20,143 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:20,143 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:20,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:27:20,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:20,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:27:20,255 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:20,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:20,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:27:20,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:27:20,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:27:20,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10000); {199#false} is VALID [2018-11-23 12:27:20,265 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:20,266 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:20,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:20,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:20,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:20,267 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:27:20,267 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:20,267 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:20,267 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:20,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:20,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:20,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:20,269 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:27:20,269 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:20,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9999); {199#false} is VALID [2018-11-23 12:27:20,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:20,270 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:27:20,270 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:20,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:27:20,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:27:20,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:20,272 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:27:20,272 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:20,272 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:20,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:27:20,276 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:20,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:20,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:20,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:20,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:20,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:20,380 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:20,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:20,381 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:27:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,949 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:27:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:20,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:20,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:27:21,094 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:21,096 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:21,096 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:27:21,098 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:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:27:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:27:21,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:21,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:21,121 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:21,121 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,125 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:21,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,127 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:21,127 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,130 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:21,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:21,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:27:21,135 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:27:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:21,135 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:27:21,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:27:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:27:21,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:21,137 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:21,137 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:21,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:27:21,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:21,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:21,277 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:21,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:21,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:21,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:21,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:21,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:27:21,279 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:21,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:27:21,279 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:21,280 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#(= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:21,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= mapsum_~i~0 0)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:21,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:21,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:21,285 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:21,285 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:21,285 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:21,286 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:21,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:27:21,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:21,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:21,287 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:21,287 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:21,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:27:21,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:21,288 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:21,288 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:21,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:27:21,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:27:21,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:21,290 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:21,290 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:21,290 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:21,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:21,293 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:21,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:21,294 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:21,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:21,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:21,756 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:21,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:21,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:21,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:21,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:21,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:27:21,759 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:21,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:27:21,760 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:27:21,763 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:21,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= mapsum_~i~0 0)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:21,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:21,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:21,765 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:21,765 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:21,765 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:27:21,766 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:21,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:21,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:21,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:21,767 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:21,767 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:21,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:27:21,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:21,768 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:27:21,769 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:21,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:27:21,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:27:21,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:21,770 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:21,771 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:21,771 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:21,771 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:21,774 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:21,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:27:21,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:27:21,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:21,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:21,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:27:21,923 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:21,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:21,924 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:27:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,246 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:27:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:22,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:22,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:27:22,358 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:22,361 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:22,361 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:27:22,362 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:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:27:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:27:22,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:22,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:22,386 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:22,386 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,389 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:22,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,390 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:22,390 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,393 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:22,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:22,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:27:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:27:22,398 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:27:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:22,398 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:27:22,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:22,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:22,400 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:22,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:22,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:27:22,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:22,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:27:22,520 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:22,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:22,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:27:22,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:27:22,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:27:22,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {630#true} is VALID [2018-11-23 12:27:22,521 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:22,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10000); {630#true} is VALID [2018-11-23 12:27:22,521 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:22,522 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:22,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:22,522 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:22,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:22,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:22,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:22,523 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:27:22,524 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:22,524 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:22,524 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:22,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:22,525 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:22,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:22,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:22,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:22,526 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:27:22,531 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:22,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9999); {631#false} is VALID [2018-11-23 12:27:22,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:27:22,533 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:27:22,534 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:22,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:22,534 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:22,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:27:22,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:27:22,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:22,535 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:27:22,535 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:22,535 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:22,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:27:22,538 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:22,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:22,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:22,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:22,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:22,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:22,659 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:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:22,660 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:27:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,783 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:27:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:22,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:22,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:27:22,894 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:22,897 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:27:22,897 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:27:22,898 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:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:27:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:27:22,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:22,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:22,923 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:22,923 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,925 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:22,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,927 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:22,927 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,929 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:22,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:22,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:27:22,933 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:27:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:22,933 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:27:22,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:27:22,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:22,935 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:22,936 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:22,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:27:22,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:23,061 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:23,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:23,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:23,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:23,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:23,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:23,066 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:23,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:27:23,068 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:23,068 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:23,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:23,069 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:23,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:23,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:23,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:23,069 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:23,070 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:23,070 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:23,070 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:23,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:23,071 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:23,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:23,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:23,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:23,072 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:23,072 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:23,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:27:23,073 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:23,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:27:23,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:23,074 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:27:23,074 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:23,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:23,075 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:23,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:27:23,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:27:23,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:23,075 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:23,076 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:23,076 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:23,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:23,079 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:23,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:23,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 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:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:23,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:23,467 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:23,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:23,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:23,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:23,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:23,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:23,470 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:23,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:27:23,471 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:23,471 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:23,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:23,471 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:23,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:23,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:23,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:23,473 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:23,473 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:23,473 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:23,473 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:23,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:23,474 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:23,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:23,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:23,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:23,475 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:23,475 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:23,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:27:23,476 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:23,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:27:23,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:23,476 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:27:23,476 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:23,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:23,477 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:23,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:27:23,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:27:23,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:23,478 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:23,478 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:23,479 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:23,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:23,482 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:23,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:23,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:27:23,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:23,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:23,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:27:23,595 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:23,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:23,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:23,596 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:27:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,795 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:27:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:23,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:23,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:27:23,886 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:23,888 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:23,888 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:27:23,889 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:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:27:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:27:23,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:23,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:23,969 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:23,969 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,971 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:23,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:23,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:23,972 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:23,972 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,974 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:23,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:23,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:23,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:23,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:27:23,978 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:27:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:23,978 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:27:23,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:27:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:27:23,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:23,980 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:23,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:23,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:27:23,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:23,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:23,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:23,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:24,148 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:24,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:24,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:24,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:24,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,158 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:24,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,160 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:24,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:27:24,161 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:24,161 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:24,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:24,162 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:24,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:24,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:24,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:24,163 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:24,163 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:24,164 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:24,164 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:24,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:24,164 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:24,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:24,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:24,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:24,165 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:24,165 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:24,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:27:24,166 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:24,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:27:24,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:24,166 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:27:24,166 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:24,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:24,167 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:24,167 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:27:24,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:27:24,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:24,168 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:24,168 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:24,168 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:24,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:24,170 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:24,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:24,171 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:24,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:24,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:24,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:24,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:24,362 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:24,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:24,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:24,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:24,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:24,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:24,365 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:24,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,369 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:24,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:27:24,370 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:24,370 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:24,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:24,371 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:24,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:24,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:24,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:24,372 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:24,372 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:24,372 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:24,372 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:24,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:24,373 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:24,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:24,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:24,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:24,373 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:24,374 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:24,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:27:24,374 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:24,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:27:24,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:24,375 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:27:24,375 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:24,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:24,375 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:24,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:27:24,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:27:24,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:24,376 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:24,376 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:24,377 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:24,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:24,379 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:24,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:24,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:27:24,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:24,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:24,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:27:24,460 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:24,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:27:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:27:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:24,461 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:27:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,623 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:27:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:24,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:24,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:27:24,744 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:24,746 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:24,746 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:27:24,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:27:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:27:24,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:24,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:24,770 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:24,770 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,773 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:24,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,773 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:24,774 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,776 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:24,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:24,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:27:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:27:24,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:27:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:24,779 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:27:24,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:27:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:27:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:27:24,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:24,781 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:24,781 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:24,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:27:24,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:24,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:24,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:24,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:25,433 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:25,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:25,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:25,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:25,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:25,448 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:25,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:25,449 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:25,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:25,450 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:25,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1447#false} is VALID [2018-11-23 12:27:25,451 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,451 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:25,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:25,452 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:25,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:25,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,453 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:27:25,453 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:25,453 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,453 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:25,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:25,454 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:25,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:25,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,455 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:27:25,455 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:25,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1447#false} is VALID [2018-11-23 12:27:25,456 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:25,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9999); {1447#false} is VALID [2018-11-23 12:27:25,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:25,457 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,457 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:25,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:25,457 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:25,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:25,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,458 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:27:25,459 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:25,459 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:25,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:25,462 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:25,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:25,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:25,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:27:25,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:25,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:25,861 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:25,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:25,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:25,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:27:25,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:25,863 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:25,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:25,864 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:25,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:25,864 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:25,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,865 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,865 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:25,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:25,866 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:25,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:25,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,866 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:27:25,867 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:25,867 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,867 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:25,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:25,868 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:25,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:27:25,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:27:25,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:25,868 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:27:25,869 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:25,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1446#true} is VALID [2018-11-23 12:27:25,869 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:25,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9999); {1446#true} is VALID [2018-11-23 12:27:25,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:25,869 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:27:25,870 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:25,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1563#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:25,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:25,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= mapsum_~i~0 1)} assume !(~i~0 < 10000); {1447#false} is VALID [2018-11-23 12:27:25,873 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:27:25,873 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:27:25,874 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:27:25,874 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:25,874 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:25,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:25,877 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:25,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:25,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:27:25,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:25,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:25,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:26,003 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:26,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:26,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:26,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:26,004 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:27:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,259 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:27:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:26,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:26,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:27:26,348 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:26,350 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:26,350 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:27:26,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:27:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:27:26,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:26,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:26,464 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:26,464 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,466 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:26,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:26,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:26,467 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:26,467 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,469 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:26,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:26,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:26,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:26,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:27:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:27:26,473 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:27:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:26,473 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:27:26,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:27:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:27:26,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:26,474 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:26,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:27:26,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:26,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:26,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:26,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:26,768 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:26,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:26,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:26,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:26,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:26,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:26,771 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:26,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:26,772 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:26,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:26,773 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:26,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:26,775 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:26,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:27:26,776 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:26,776 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:26,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,777 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:26,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,778 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:26,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:26,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:26,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:26,779 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:26,779 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:26,779 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:26,780 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:26,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,780 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:26,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,780 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:26,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:26,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:26,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:26,781 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:26,781 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:26,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:27:26,781 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:26,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:27:26,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:26,782 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:27:26,782 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:26,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,783 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:26,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:26,783 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:26,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:27:26,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:27:26,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:26,784 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:26,784 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:26,785 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:26,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:26,788 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:26,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:26,789 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:26,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:26,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:26,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:26,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:26,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:26,986 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:26,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:26,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:26,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:26,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:26,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:26,988 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:26,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:26,989 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:26,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:26,990 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:26,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:26,992 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:26,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:27:26,993 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:26,993 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:26,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:26,994 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:26,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:26,994 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:26,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:26,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:26,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:26,996 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:26,996 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:26,997 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:26,997 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:26,997 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:26,997 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:26,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:26,998 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:26,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:26,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:26,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:26,999 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:26,999 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:26,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:27:27,000 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:27,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:27:27,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:27,000 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:27:27,001 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:27,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:27,001 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:27,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:27,001 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:27,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:27:27,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:27:27,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:27,002 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:27,002 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:27,002 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:27,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:27,006 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:27,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:27:27,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:27,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:27,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:27,081 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:27,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:27,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:27,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:27,083 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:27:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,324 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:27:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:27,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:27,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:27:27,439 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:27,441 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:27:27,441 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:27,442 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:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:27:27,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:27,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:27,459 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:27,460 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,463 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:27,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,463 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:27,464 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,465 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:27,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:27,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:27:27,468 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:27:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:27,468 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:27:27,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:27:27,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:27,469 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:27,470 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:27,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:27:27,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:27,698 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:27,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:27,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:27,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:27,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,704 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:27,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,705 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:27,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,706 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:27,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,707 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:27,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,708 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:27,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2207#false} is VALID [2018-11-23 12:27:27,709 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:27,709 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:27,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,709 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:27,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,710 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:27,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:27,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:27,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:27,711 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:27:27,712 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:27,712 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:27,712 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:27,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,713 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:27,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,714 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:27,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:27,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:27,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:27,716 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:27,716 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:27,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:27:27,716 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:27,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:27:27,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:27,717 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:27,717 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:27,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,717 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:27,718 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:27,718 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:27,718 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:27:27,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:27:27,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:27,718 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:27,719 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:27,719 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:27,719 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:27,721 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:27,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:27,722 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:27,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:27,797 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:27:27,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:28,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:28,085 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:28,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:28,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:28,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:28,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:27:28,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:28,086 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:28,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:28,086 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:28,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:28,087 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:28,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:28,087 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:28,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:28,087 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:28,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 10000); {2206#true} is VALID [2018-11-23 12:27:28,087 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:27:28,088 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:28,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2271#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:28,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2278#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:28,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2278#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:28,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2285#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:28,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= mapsum_~i~0 2)} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:28,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:28,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:28,095 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:27:28,095 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:28,095 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:27:28,095 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:28,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:28,096 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:28,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:28,096 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:28,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:28,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:28,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:28,096 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:28,097 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:28,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:27:28,097 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:28,097 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:27:28,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:28,097 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:27:28,098 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:28,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:28,098 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:28,098 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:28,098 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:28,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:27:28,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:27:28,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:28,099 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:28,099 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:28,100 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:28,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:28,102 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:28,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:28,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:27:28,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:28,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:28,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:28,257 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:28,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:28,258 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:27:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,851 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:27:28,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:28,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:28,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:27:28,925 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:28,927 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:27:28,928 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:28,929 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:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:27:28,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:28,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:28,949 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:28,949 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,951 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:28,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,951 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:28,952 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,954 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:28,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:28,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:27:28,957 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:27:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:28,958 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:27:28,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:27:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:27:28,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:28,959 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:28,959 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:28,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:27:28,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:28,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:29,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:29,258 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:29,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:29,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:29,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:29,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:29,260 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:29,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:29,261 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:29,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:29,262 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:29,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:29,263 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:29,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:29,264 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:29,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:29,266 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:29,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 10000); {2636#false} is VALID [2018-11-23 12:27:29,267 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:29,267 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:29,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,267 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:29,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,268 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:29,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,268 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:29,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:29,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,269 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:27:29,269 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:29,269 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:29,269 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:29,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,269 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:29,269 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,269 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:29,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,270 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:29,270 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:29,270 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,270 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:27:29,270 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:29,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2636#false} is VALID [2018-11-23 12:27:29,271 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:29,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:27:29,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:29,271 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:29,271 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:29,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,271 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:29,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,272 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:29,272 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,272 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:29,272 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:29,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,272 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:29,272 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:29,273 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:29,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:29,275 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:29,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:29,275 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:29,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:29,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:27:29,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:29,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:29,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:29,503 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:29,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:29,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:29,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:27:29,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,504 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:29,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,504 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:29,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,504 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:29,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,505 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:29,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,505 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:29,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:29,505 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:29,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,506 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:29,506 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:29,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,506 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:29,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,507 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:29,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,507 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:29,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:29,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,508 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:27:29,508 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:29,508 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:27:29,508 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:29,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,509 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:29,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,509 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:29,509 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:29,509 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:29,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:27:29,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:27:29,510 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:29,510 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:27:29,510 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:29,511 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:29,511 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:29,512 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:27:29,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:29,512 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:27:29,512 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:29,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:29,512 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:29,512 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:29,513 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:29,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:29,513 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:29,513 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 10000); {2636#false} is VALID [2018-11-23 12:27:29,513 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:27:29,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:27:29,514 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:29,514 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:29,514 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:29,514 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:29,517 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:29,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:29,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:27:29,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:29,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:29,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:29,681 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:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:29,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:29,682 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:27:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,113 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:27:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:30,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:30,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:27:30,211 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:30,213 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:27:30,213 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:30,214 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:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:30,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:30,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:30,237 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:30,237 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,239 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:30,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,240 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:30,240 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,242 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:30,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:30,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:27:30,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:27:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:30,244 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:27:30,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:27:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:27:30,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:30,245 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:30,246 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:30,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:30,246 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:27:30,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:30,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:30,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:30,496 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:30,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:30,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:30,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:30,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,498 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:30,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,500 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:30,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,501 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:30,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,502 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:30,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,503 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:30,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,505 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:30,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,506 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:30,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:27:30,507 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:30,507 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:30,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,507 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:30,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,508 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:30,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,508 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:30,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:30,509 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:30,510 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:30,510 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:30,510 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:30,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,510 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:30,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,511 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:30,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,511 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:30,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:30,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:30,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:30,512 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:30,512 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:30,512 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:30,512 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:30,512 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:30,512 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:30,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:27:30,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:30,513 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:27:30,513 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:30,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,514 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:30,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,514 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:30,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:30,514 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:30,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:27:30,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:27:30,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:30,515 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:30,515 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:30,515 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:30,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:30,518 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:30,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:30,519 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:30,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:30,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:30,713 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:30,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:30,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:30,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:30,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,715 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:30,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,716 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:30,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,717 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:30,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,718 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:30,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,719 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:30,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,720 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:30,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,721 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:30,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:27:30,722 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:30,722 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:30,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,723 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:30,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,723 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:30,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,724 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:30,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:30,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:30,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:30,724 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:30,725 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:30,725 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:30,725 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:30,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,725 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:30,725 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,725 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:30,726 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,726 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:30,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:30,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:30,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:30,726 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:30,726 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:30,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:30,727 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:30,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:30,727 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:30,727 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:27:30,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:30,727 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:27:30,727 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:30,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,728 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:30,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,728 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:30,728 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:30,728 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:30,728 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:27:30,728 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:27:30,728 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:30,729 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:30,729 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:30,729 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:30,729 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:30,731 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:30,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:30,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:30,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:30,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:30,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:30,810 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:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:30,811 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:31,061 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:31,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:31,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:31,140 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:31,142 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:31,142 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:31,143 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:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:31,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:31,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:31,170 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:31,170 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:31,171 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:31,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:31,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:31,172 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:31,172 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:31,173 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:31,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:31,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:31,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:31,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:31,176 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:31,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:31,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:31,177 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:31,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:31,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:27:31,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:31,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:31,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:31,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:31,403 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:31,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:31,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:31,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:31,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:31,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:31,405 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:31,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:31,406 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:31,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:31,407 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:31,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:31,408 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:31,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:31,410 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:31,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:31,411 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:31,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:31,412 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:31,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:31,413 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:31,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:27:31,414 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:31,415 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:31,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,415 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:31,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,415 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:31,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,416 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:31,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:31,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:31,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:31,417 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:31,417 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:31,417 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:31,417 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:31,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,418 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:31,418 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,418 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:31,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,418 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:31,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:31,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:31,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:31,419 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:31,419 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:31,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:31,419 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:31,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:31,420 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:31,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:27:31,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:31,420 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:27:31,420 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:31,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,421 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:31,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,421 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:31,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:31,421 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:31,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:27:31,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:27:31,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:31,422 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:31,422 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:31,422 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:31,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:31,427 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:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:31,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:31,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:31,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:31,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:31,691 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:31,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:31,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:31,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:31,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:31,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:31,693 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:31,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:31,694 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:31,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:31,695 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:31,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:31,696 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:31,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:31,697 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:31,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:31,698 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:31,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:31,700 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:31,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:31,701 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:31,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:27:31,702 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:31,702 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:31,702 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,702 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:31,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,703 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:31,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,703 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:31,703 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:31,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:31,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:31,704 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:31,704 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:31,704 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:31,704 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:31,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,705 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:31,705 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,705 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:31,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,705 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:31,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:31,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:31,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:31,706 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:31,706 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:31,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:31,706 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:31,706 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:31,706 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:31,706 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:27:31,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:31,707 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:27:31,707 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:31,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,707 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:31,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,707 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:31,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:31,708 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:31,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:27:31,708 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:27:31,708 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:31,708 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:31,708 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:31,708 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:31,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:31,711 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:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:31,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:31,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:31,784 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:31,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:31,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:31,785 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:31,966 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:31,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:31,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:31,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:32,054 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:32,055 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:32,056 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:32,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:32,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:32,078 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:32,079 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,081 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:32,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,082 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:32,082 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,083 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:32,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:32,086 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,086 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:32,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:32,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,087 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:32,088 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:27:32,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:32,298 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:32,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:32,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:32,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:32,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:32,300 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:32,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:32,301 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:32,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:32,302 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:32,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:32,303 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:32,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:32,304 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:32,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:32,306 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:32,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:32,307 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:32,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:32,308 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:32,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:32,310 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:32,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 10000); {4125#false} is VALID [2018-11-23 12:27:32,311 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:32,311 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:32,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,311 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:32,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,312 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:32,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,312 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:32,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:32,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,313 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:32,313 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:32,313 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:32,314 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:32,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,314 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:32,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,314 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:32,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,314 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:32,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:32,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,315 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:32,315 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:32,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:32,315 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:32,315 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:32,316 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:32,316 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:27:32,316 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:32,316 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:32,316 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:32,316 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,316 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:32,316 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,316 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:32,317 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,317 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:32,317 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,317 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:32,317 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,317 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:32,317 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:32,317 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:32,318 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:32,320 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:32,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:32,320 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:32,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:32,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:32,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:32,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:32,553 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:32,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:32,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:32,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:32,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,555 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:32,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,555 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:32,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,556 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:32,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,556 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:32,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,556 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:32,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,557 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:32,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,557 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:32,557 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,557 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:32,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:32,558 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:32,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,558 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:32,558 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:32,558 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,558 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:32,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,559 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:32,559 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,559 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:32,559 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:32,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,560 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:32,560 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:32,560 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:27:32,560 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:32,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,560 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:32,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,561 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:32,561 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:32,561 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:32,561 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:27:32,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:27:32,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:32,562 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:32,562 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:32,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:32,563 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:32,564 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:32,564 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:32,565 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:27:32,565 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:32,565 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:27:32,565 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:32,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:32,566 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:32,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:32,566 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:32,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:32,567 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:32,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 10000); {4125#false} is VALID [2018-11-23 12:27:32,567 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:27:32,567 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:32,568 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:32,568 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:32,568 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:32,568 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:32,573 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:32,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:32,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:32,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:32,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:32,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:32,685 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:32,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:32,686 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,251 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:33,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:33,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:33,338 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:33,340 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:33,340 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:33,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:33,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:33,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:33,367 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:33,368 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,370 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:33,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:33,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:33,371 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:33,371 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,372 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:33,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:33,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:33,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:33,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:33,375 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:33,375 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:33,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:33,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:33,376 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:33,377 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:33,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:27:33,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:33,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:34,347 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:34,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:34,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:34,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,351 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:34,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,352 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:34,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 10000); {4672#false} is VALID [2018-11-23 12:27:34,360 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:34,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:34,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:34,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,362 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:34,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:34,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,362 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:34,363 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:34,363 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,363 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4671#true} is VALID [2018-11-23 12:27:34,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,363 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:34,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,363 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:34,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,364 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4671#true} is VALID [2018-11-23 12:27:34,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:34,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,364 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:34,364 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:34,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:34,364 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:34,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:34,365 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:34,365 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:34,365 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:34,365 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 9999); {4672#false} is VALID [2018-11-23 12:27:34,365 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:34,365 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,365 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:34,366 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,366 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:34,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,366 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:34,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,366 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:34,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,366 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:34,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,367 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:34,367 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:34,367 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:34,367 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:34,370 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:34,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:34,370 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:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:34,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:34,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:34,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:34,632 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:34,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:34,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:34,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:34,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,633 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:34,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,634 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:34,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,634 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:34,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,635 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:34,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,635 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:34,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,635 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:34,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,635 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:34,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,635 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:34,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,636 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:34,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:34,636 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:34,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,636 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,636 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:34,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,637 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:34,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,637 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:34,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,637 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:34,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:34,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,638 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:34,638 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:34,638 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,638 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:34,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,638 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:34,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,638 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:34,639 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:34,639 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:34,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:27:34,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:27:34,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:34,639 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:34,639 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:34,639 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:34,639 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:34,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:34,640 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:34,640 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:34,640 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:34,640 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 9999); {4671#true} is VALID [2018-11-23 12:27:34,640 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:34,640 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:27:34,641 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:34,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4873#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:34,642 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4880#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:34,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4880#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:34,643 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4887#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:34,643 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4887#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:34,643 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4894#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:34,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= mapsum_~i~0 3)} assume !(~i~0 < 10000); {4672#false} is VALID [2018-11-23 12:27:34,644 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:27:34,644 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:34,644 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:34,644 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:34,644 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:34,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:34,648 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:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:34,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:34,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:34,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:34,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:34,878 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:34,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:34,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:34,880 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:35,380 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:35,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:35,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:35,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:35,873 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:35,874 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:35,875 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:35,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:35,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:35,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:35,903 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:35,903 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:35,905 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:35,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:35,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:35,905 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:35,905 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:35,907 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:35,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:35,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:35,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:35,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:35,910 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:35,910 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:35,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:35,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:35,911 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:35,911 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:35,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:27:35,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:35,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:35,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:37,117 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:37,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:37,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:37,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:37,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:37,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:37,119 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:37,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:37,120 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:37,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:37,121 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:37,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:37,122 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:37,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:37,123 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:37,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:37,124 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:37,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:37,145 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:37,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:37,146 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:37,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:37,146 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:37,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:37,147 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:37,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:37,148 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:37,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 10000); {5256#false} is VALID [2018-11-23 12:27:37,149 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:37,149 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:37,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,149 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:37,150 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,150 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:37,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,150 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:37,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,151 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:37,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:37,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:37,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:37,152 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:37,152 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:37,152 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:37,152 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:37,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,153 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:37,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,153 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:37,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,153 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:37,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,153 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:37,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:37,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:37,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:37,154 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:37,154 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:37,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,154 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:37,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,155 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:37,155 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,155 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:37,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:27:37,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:37,155 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:37,155 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:37,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,156 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:37,156 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,156 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:37,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,156 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:37,156 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:37,156 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:37,156 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:27:37,157 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:27:37,157 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:37,157 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:37,157 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:37,157 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:37,157 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:37,160 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:37,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:37,160 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:37,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:37,479 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:37,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:37,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:37,771 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:37,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:37,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:37,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:37,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:37,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,772 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:37,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,773 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:37,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,773 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:37,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,773 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:37,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,774 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:37,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,774 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:37,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,774 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:37,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,774 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:37,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,774 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:37,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,775 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:37,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:37,775 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:37,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 10000); {5255#true} is VALID [2018-11-23 12:27:37,775 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:27:37,776 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:37,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5362#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:37,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5369#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:37,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5369#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:37,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5376#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:37,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5376#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:37,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5383#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:37,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5383#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:37,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:37,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= mapsum_~i~0 4)} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:37,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:37,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:37,780 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:37,780 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:37,780 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:37,780 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:37,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,781 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:37,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,781 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:37,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,782 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:37,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,782 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:37,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:37,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:37,783 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:37,783 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:37,783 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:37,783 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,783 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:37,783 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,784 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:37,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:37,784 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:37,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:27:37,784 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:37,784 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:27:37,784 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:37,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,784 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:37,785 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,785 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:37,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,785 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:37,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:37,785 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:37,785 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:27:37,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:27:37,786 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:37,786 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:37,786 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:37,786 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:37,786 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:37,789 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:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:37,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:37,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:37,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:37,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:37,879 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:37,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:37,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:37,880 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,538 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:38,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:38,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:39,608 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:39,610 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:39,610 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:39,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:39,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:39,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:39,636 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:39,637 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,639 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:39,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,640 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:39,640 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,641 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:39,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:39,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:39,643 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:39,644 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:39,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:39,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:39,645 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:39,645 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:39,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:27:39,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:39,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:39,933 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:39,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:39,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:39,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:39,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:39,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:39,935 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:39,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:39,935 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:39,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:39,936 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:39,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:39,938 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:39,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:39,939 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:39,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:39,940 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:39,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:39,941 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:39,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:39,943 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:39,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:39,944 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:39,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:39,945 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:39,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:39,946 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:39,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:39,947 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:39,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 10000); {5889#false} is VALID [2018-11-23 12:27:39,948 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:39,949 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:39,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,949 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:39,949 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,949 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:39,949 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,950 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:39,950 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,950 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:39,950 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,950 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:39,951 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:39,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:39,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:39,951 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:27:39,951 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:39,951 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:39,951 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:39,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,951 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:39,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,952 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:39,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,952 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:39,952 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,952 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:39,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,952 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:39,953 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:39,953 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:39,953 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:39,953 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:27:39,953 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:39,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:39,954 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:39,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:39,954 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:39,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:39,954 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:39,954 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:27:39,955 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:39,955 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:39,955 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:39,955 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,955 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:39,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,955 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:39,956 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,956 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:39,956 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,956 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:39,956 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:39,956 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:39,956 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:39,957 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:39,957 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:39,957 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:39,957 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:39,957 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:39,957 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:39,962 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:39,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:39,962 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:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:40,130 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:27:40,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:40,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:40,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:40,394 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:40,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:40,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:40,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:40,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:27:40,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,395 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:40,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,395 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:40,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,395 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:40,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,395 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:40,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,396 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:40,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,396 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:40,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,396 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:40,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,396 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:40,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,397 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:40,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,397 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:40,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,397 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:40,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:40,397 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:40,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 10000); {5888#true} is VALID [2018-11-23 12:27:40,398 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:40,398 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:40,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,398 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:40,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,398 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:40,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,398 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:40,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,399 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:40,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,399 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:40,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:40,399 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:40,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:40,399 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:27:40,399 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:40,400 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:27:40,400 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:40,400 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,400 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:40,400 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,400 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:40,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,400 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:40,401 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,401 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:40,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:40,401 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:40,401 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:27:40,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:27:40,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:40,401 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:27:40,402 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:40,402 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:40,403 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:40,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:40,403 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:40,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:40,404 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:40,405 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:27:40,405 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:40,405 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:27:40,405 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:40,405 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:40,405 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:40,405 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:40,406 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:40,406 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:40,406 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:40,406 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:40,407 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:40,407 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:40,407 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:40,408 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 10000); {5889#false} is VALID [2018-11-23 12:27:40,408 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:27:40,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:27:40,408 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:40,409 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:40,409 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:40,409 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:40,413 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:40,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:40,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:27:40,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:40,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:40,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:40,505 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:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:40,507 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:27:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,095 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:27:41,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:41,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:41,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:41,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:27:41,562 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:41,564 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:27:41,564 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:27:41,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:27:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:27:41,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:41,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:41,596 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:41,596 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,598 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:41,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:41,599 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:41,599 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,601 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:41,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:41,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:41,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:41,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:27:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:27:41,604 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:27:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:41,604 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:27:41,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:27:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:27:41,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:41,605 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:41,606 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:41,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:27:41,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:41,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:42,258 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:42,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:42,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:42,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:42,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:42,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:42,260 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:42,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:42,262 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:42,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:42,263 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:42,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:42,264 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:42,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:42,266 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:42,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:42,267 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:42,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:42,268 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:42,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:42,269 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:42,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:42,271 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:42,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:42,272 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:42,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:42,273 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:42,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:42,274 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:42,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:42,275 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:42,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:27:42,276 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:42,277 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:42,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,277 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:42,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,277 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:42,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,278 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:42,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,278 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:42,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,278 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:42,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:42,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:42,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:42,279 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:42,279 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:42,280 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:42,280 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:42,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,280 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:42,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,281 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:42,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,281 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:42,281 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,281 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:42,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,282 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:42,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:42,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:42,282 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:42,282 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:42,282 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:42,282 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,283 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:42,283 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,283 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:42,283 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,283 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:42,283 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,283 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:42,283 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:27:42,284 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:42,284 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:27:42,284 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:42,284 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,284 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:42,284 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,284 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:42,284 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,284 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:42,285 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,285 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:42,285 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:42,285 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:42,285 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:27:42,285 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:27:42,285 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:42,285 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:42,286 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:42,286 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:42,286 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:42,290 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:42,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:42,290 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:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:42,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:42,697 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:42,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:42,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:42,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:42,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:42,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:42,699 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:42,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:42,700 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:42,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:42,701 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:42,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:42,702 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:42,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:42,704 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:42,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:42,705 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:42,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:42,707 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:42,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:42,708 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:42,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:42,710 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:42,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:42,711 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:42,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:42,713 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:42,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:42,714 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:42,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:42,716 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:42,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:27:42,717 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:42,717 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:42,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,718 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:42,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,718 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:42,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,719 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:42,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,719 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:42,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,720 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:42,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:42,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:42,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:42,720 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:42,720 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:42,721 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:42,721 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:42,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,721 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:42,721 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,721 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:42,721 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,722 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:42,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,722 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:42,722 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,722 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:42,722 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:42,722 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:42,723 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:42,723 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:42,723 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:42,723 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,723 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:42,723 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,724 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:42,724 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,724 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:42,724 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:42,724 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:42,724 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:27:42,724 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:42,725 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:27:42,725 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:42,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,725 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:42,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,725 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:42,725 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,726 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:42,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,726 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:42,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:42,726 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:42,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:27:42,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:27:42,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:42,727 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:42,727 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:42,727 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:42,727 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:42,736 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:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:27:42,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:42,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:42,829 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:42,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:42,830 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:27:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,568 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:27:43,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:27:43,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:43,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:27:44,048 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:44,050 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:27:44,050 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:27:44,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:27:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:27:44,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:44,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:44,099 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:44,099 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,103 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:44,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:44,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:44,103 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:44,104 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,105 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:44,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:44,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:44,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:44,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:27:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:27:44,108 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:27:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:44,109 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:27:44,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:27:44,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:44,110 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:44,110 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:27:44,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:44,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:44,395 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:44,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:44,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:44,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:44,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:44,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:44,397 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:44,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:44,398 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:44,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:44,399 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:44,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:44,400 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:44,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:44,401 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:44,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:44,402 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:44,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:44,404 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:44,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:44,405 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:44,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:44,406 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:44,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:44,407 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:44,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:44,409 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:44,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:44,410 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:44,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:44,411 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:44,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:44,412 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:44,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:27:44,413 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:44,413 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:44,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,414 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:44,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,414 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:44,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,414 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:44,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,415 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:44,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,415 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:44,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:44,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:44,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:44,416 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:44,416 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:44,416 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:44,416 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:44,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,416 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:44,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,417 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:44,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,417 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:44,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,417 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:44,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,417 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:44,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:44,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:44,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:44,418 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:44,418 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:44,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,418 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:44,418 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,418 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:44,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,419 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:44,419 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,419 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:44,419 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:27:44,419 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:44,419 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:27:44,419 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:44,419 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,420 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:44,420 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,420 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:44,420 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,420 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:44,420 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,420 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:44,420 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:44,420 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:44,421 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:27:44,421 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:27:44,421 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:44,421 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:44,421 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:44,421 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:44,421 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:44,425 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:44,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:44,426 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:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:44,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:44,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:44,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:44,847 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:44,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:44,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:44,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:44,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:44,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:44,849 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:44,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:44,850 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:44,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:44,851 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:44,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:44,852 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:44,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:44,853 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:44,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:44,854 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:44,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:44,855 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:44,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:44,857 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:44,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:44,858 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:44,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:44,859 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:44,860 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:44,860 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:44,861 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:44,862 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:44,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:44,863 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:44,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:44,864 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:44,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:27:44,865 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:44,865 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:44,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,865 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:44,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,866 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:44,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,866 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:44,866 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,867 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:44,867 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,867 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:44,867 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:44,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:44,867 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:44,868 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:44,868 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:44,868 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:44,868 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:44,868 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,869 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:44,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,869 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:44,869 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,869 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:44,869 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,869 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:44,869 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,870 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:44,870 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:44,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:44,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:44,870 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:44,870 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:44,870 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,870 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:44,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,871 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:44,871 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,871 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:44,871 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:44,871 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:44,871 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:27:44,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:44,871 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:27:44,871 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:44,872 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,872 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:44,872 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,872 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:44,872 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,872 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:44,872 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,872 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:44,873 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:44,873 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:44,873 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:27:44,873 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:27:44,873 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:44,873 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:44,873 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:44,873 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:44,873 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:44,878 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:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:27:44,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:44,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:44,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:27:44,979 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:44,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:27:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:27:44,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:44,980 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:27:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,425 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:27:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:45,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:45,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:27:45,521 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:45,524 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:27:45,524 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:27:45,524 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:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:27:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:27:45,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:45,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:45,554 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:45,554 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,556 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:45,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,557 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:45,557 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,559 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:45,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:45,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:27:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:27:45,561 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:27:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:45,562 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:27:45,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:27:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:27:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:27:45,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:45,563 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:45,563 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:45,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:27:45,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:45,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:46,256 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:46,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:46,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:46,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,258 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:46,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,259 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:46,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,260 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:46,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,261 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:46,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,262 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:46,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,263 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:46,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,265 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:46,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,266 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:46,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,267 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:46,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,269 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:46,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,270 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:46,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,271 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:46,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,272 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:46,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,274 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:46,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,275 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:46,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 10000); {7986#false} is VALID [2018-11-23 12:27:46,276 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,276 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:46,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,277 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:46,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,277 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:46,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,277 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:46,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,278 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:46,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,278 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:46,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:46,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,279 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:27:46,279 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:46,279 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,280 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:46,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,280 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:46,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,280 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:46,281 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,281 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:46,281 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,281 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:46,281 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,281 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:46,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,281 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:46,281 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,282 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:27:46,282 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:46,282 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:46,282 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:46,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:46,282 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:46,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:46,282 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:46,283 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:46,283 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:46,283 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 9999); {7986#false} is VALID [2018-11-23 12:27:46,283 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:27:46,283 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,283 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:46,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,283 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:46,283 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,284 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:46,284 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,284 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:46,284 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,284 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:46,284 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,284 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:46,284 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,284 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:46,285 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,285 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:27:46,285 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:46,285 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:46,285 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:46,290 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:46,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:46,290 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:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:46,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:27:46,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:46,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:46,561 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:46,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:46,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:46,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:27:46,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,562 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:46,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,563 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:46,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,563 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:46,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,563 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:46,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,563 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:46,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,564 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:46,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,564 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:46,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,564 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:46,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,564 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:46,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,565 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:46,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,565 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:46,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,565 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:46,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,565 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:46,565 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,565 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:46,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:46,566 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:46,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,566 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,566 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:46,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,566 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:46,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,567 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:46,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,567 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:46,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,567 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:46,567 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,567 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:46,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:46,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,568 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:27:46,568 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:46,568 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,568 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:46,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,568 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:46,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,569 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:46,569 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,569 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:46,569 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,569 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:46,569 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:46,569 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:46,569 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:27:46,569 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:27:46,570 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:46,570 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:27:46,570 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:46,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:46,570 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:46,570 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:46,570 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:46,570 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:46,571 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:46,571 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:46,571 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:46,571 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 9999); {7985#true} is VALID [2018-11-23 12:27:46,571 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:27:46,571 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:27:46,572 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:46,572 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8252#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:46,573 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8259#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:46,573 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8259#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:46,573 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8266#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:46,574 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8266#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:46,574 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8273#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:46,574 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8273#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:46,575 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8280#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:46,575 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8280#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:46,576 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8287#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:27:46,577 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= mapsum_~i~0 5)} assume !(~i~0 < 10000); {7986#false} is VALID [2018-11-23 12:27:46,577 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:27:46,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:27:46,577 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:27:46,578 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:46,578 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:46,578 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:46,583 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:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:46,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:27:46,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:46,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:46,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:46,723 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:46,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:46,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:46,724 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:27:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,108 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:27:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:27:47,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:47,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:27:47,227 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:47,229 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:27:47,229 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:27:47,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:27:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:27:47,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:47,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:47,257 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:47,257 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,259 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:47,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,260 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:47,260 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,261 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:47,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:47,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:27:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:27:47,264 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:27:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:47,264 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:27:47,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:27:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:27:47,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:47,265 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:47,266 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:47,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:27:47,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:47,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:47,991 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:47,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:47,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:47,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:47,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:47,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:47,993 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:47,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:47,994 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:47,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:47,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:47,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:47,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:47,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:47,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:47,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:47,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:47,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:47,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:47,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:48,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:48,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:48,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:48,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:48,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:48,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:48,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:48,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:48,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:48,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:48,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:48,007 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:48,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:48,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:48,009 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:48,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:48,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:48,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:27:48,011 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:48,011 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:48,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,012 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:48,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,012 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:48,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,012 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:48,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,013 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:48,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,013 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:48,013 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,014 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:48,014 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:48,014 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:48,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:48,014 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:48,014 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:48,014 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:48,014 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:48,015 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,015 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:48,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,015 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:48,015 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,015 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:48,015 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,015 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:48,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,016 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:48,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,016 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:48,016 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:48,016 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:48,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:48,016 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:48,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:48,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,017 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:48,017 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,017 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:48,017 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,017 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:48,017 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,017 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:48,017 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:27:48,018 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:48,018 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:27:48,018 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:48,018 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,018 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:48,018 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,018 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:48,018 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,019 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:48,019 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,019 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:48,019 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,019 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:48,019 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:48,019 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:48,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:27:48,019 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:27:48,020 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:48,020 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:48,020 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:48,020 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:48,020 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:48,025 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:48,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:48,025 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:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:48,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:48,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:48,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:48,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:48,437 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:48,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:48,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:48,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:48,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:48,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:48,439 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:48,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:48,441 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:48,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:48,443 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:48,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:48,445 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:48,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:48,448 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:48,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:48,450 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:48,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:48,452 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:48,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:48,454 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:48,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:48,457 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:48,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:48,459 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:48,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:48,461 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:48,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:48,463 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:48,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:48,465 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:48,467 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:48,467 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:48,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:48,469 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:48,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:48,471 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:48,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:27:48,473 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:48,473 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:48,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,473 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:48,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,473 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:48,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,474 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:48,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,474 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:48,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,474 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:48,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,474 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:48,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:48,475 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:48,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:48,475 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:48,475 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:48,475 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:48,475 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:48,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,475 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:48,476 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,476 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:48,476 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,476 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:48,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,476 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:48,476 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,476 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:48,476 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,477 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:48,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:48,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:48,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:48,477 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:48,477 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:48,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,477 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:48,477 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,478 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:48,478 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,478 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:48,478 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:48,478 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:48,478 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:27:48,478 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:48,478 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:27:48,478 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:48,479 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,479 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:48,479 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,479 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:48,479 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,479 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:48,479 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,479 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:48,480 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,480 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:48,480 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:48,480 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:48,480 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:27:48,480 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:27:48,480 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:48,480 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:48,480 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:48,481 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:48,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:48,486 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:48,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:48,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:27:48,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:48,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:48,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:27:48,622 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:48,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:27:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:27:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:48,623 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:27:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,145 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:27:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:49,145 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:49,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:27:49,322 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:49,324 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:27:49,324 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:27:49,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:27:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:27:49,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:49,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:49,359 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:49,359 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,361 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:49,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,362 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:49,362 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:49,364 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:49,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:49,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:49,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:49,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:27:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:27:49,366 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:27:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:49,367 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:27:49,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:27:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:27:49,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:49,368 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:49,368 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:49,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:27:49,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:49,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:49,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:49,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:49,691 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:49,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:49,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:49,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:49,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,694 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:49,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,695 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:49,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,696 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:49,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,697 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:49,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,699 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:49,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,700 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:49,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,701 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:49,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,702 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:49,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,703 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:49,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,705 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:49,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,706 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:49,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,709 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:49,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,710 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:49,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,711 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:49,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,712 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:49,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,713 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:49,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,714 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:49,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 10000); {9520#false} is VALID [2018-11-23 12:27:49,715 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:49,715 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:49,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,716 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:49,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,716 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:49,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,717 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:49,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,717 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:49,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,717 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:49,717 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,718 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:49,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:49,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:49,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:49,718 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:27:49,718 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:49,718 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:49,719 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:49,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,719 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:49,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,719 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:49,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,719 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:49,719 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,720 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:49,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,720 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:49,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,720 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:49,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:49,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:49,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:49,720 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:49,721 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:49,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:49,721 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:49,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:49,721 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:49,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:49,721 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:49,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:49,721 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:49,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:27:49,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:49,722 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:49,722 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:49,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,722 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:49,722 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,722 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:49,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,723 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:49,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,723 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:49,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,723 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:49,723 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:49,723 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:49,723 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:27:49,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:27:49,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:49,724 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:49,724 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:49,724 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:49,724 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:49,729 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:49,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:49,730 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:49,743 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:50,775 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:27:50,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:50,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:51,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:51,044 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:51,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:51,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:51,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:51,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:27:51,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,045 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:51,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,046 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:51,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,046 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:51,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,046 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:51,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,047 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:51,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,047 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:51,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,048 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:51,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,048 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:51,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,048 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:51,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,049 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:51,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,049 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:51,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,049 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:51,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,050 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:51,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,050 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:51,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,050 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:51,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,051 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:51,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:51,051 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:51,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 10000); {9519#true} is VALID [2018-11-23 12:27:51,051 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:27:51,067 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#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:51,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9668#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:51,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9675#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:51,077 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9675#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:51,082 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9682#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:51,082 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9682#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:51,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9689#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:51,083 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9689#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:51,083 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9696#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:51,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9696#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:51,084 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9703#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:27:51,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9703#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:27:51,085 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9710#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:27:51,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= mapsum_~i~0 6)} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:51,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:51,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:51,086 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:27:51,086 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:51,086 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:27:51,086 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:51,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,087 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:51,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,087 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:51,087 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,087 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:51,088 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,088 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:51,088 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,088 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:51,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,088 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:51,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:51,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:51,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:51,089 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:51,089 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:51,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:51,089 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:51,089 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:51,089 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:51,089 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:51,089 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:51,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:51,090 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:51,090 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:27:51,090 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:51,090 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:27:51,090 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:51,090 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,090 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:51,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,090 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:51,091 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,091 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:51,091 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,091 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:51,091 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,091 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:51,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:51,091 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:51,091 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:27:51,092 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:27:51,092 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:51,092 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:51,092 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:51,092 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:51,092 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:51,097 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:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:27:51,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:51,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:51,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:27:51,211 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,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:27:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:27:51,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:51,212 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:27:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,387 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:27:52,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:27:52,388 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:52,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:27:52,553 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:52,555 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:27:52,555 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:27:52,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:27:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:27:52,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:52,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:52,592 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:52,592 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,594 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:52,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,596 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:52,596 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,598 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:52,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:52,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:27:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:27:52,601 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:27:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:52,601 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:27:52,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:27:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:27:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:27:52,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:52,602 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:52,603 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:52,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:27:52,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:53,426 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:53,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:53,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:53,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,428 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:53,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,430 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:53,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,432 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:53,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,436 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:53,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,438 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:53,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,441 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:53,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,443 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:53,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,449 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:53,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:53,451 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:53,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:53,454 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:53,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:53,456 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:53,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:53,458 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:53,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:53,460 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:53,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:53,468 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:53,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:53,472 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:53,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:53,474 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:53,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:53,476 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:53,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:53,478 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:53,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 10000); {10338#false} is VALID [2018-11-23 12:27:53,478 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:53,478 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:53,478 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,479 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:53,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,479 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:53,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,479 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:53,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,479 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:53,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,479 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:53,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,480 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:53,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,480 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:53,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:53,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,480 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:27:53,480 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:53,481 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:53,481 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:53,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,481 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:53,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,481 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:53,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,481 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:53,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,482 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:53,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,482 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:53,482 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,482 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:53,482 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,482 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:53,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,483 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:53,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,483 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:27:53,483 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:53,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:53,483 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:53,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:53,483 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:53,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:53,484 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:53,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:53,484 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:53,484 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:27:53,484 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:53,484 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:53,484 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:53,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,484 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:53,485 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,485 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:53,485 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,485 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:53,485 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,485 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:53,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,485 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:53,486 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,486 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:53,486 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,486 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:53,486 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:53,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,486 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:53,486 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:53,487 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:53,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:53,493 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:53,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:53,493 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:53,502 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:53,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:27:53,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:53,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:53,970 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:53,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:53,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:53,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:27:53,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,971 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:53,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,972 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:53,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,972 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:53,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,973 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:53,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,973 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:53,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,973 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:53,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,974 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:53,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,974 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:53,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,974 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:53,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,974 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:53,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,975 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:53,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,975 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:53,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,975 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:53,975 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,975 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:53,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,976 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:53,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,976 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:53,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,976 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:53,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:53,976 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:53,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,976 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:53,977 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:53,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,977 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:53,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,977 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:53,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,977 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:53,977 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,978 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:53,978 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,978 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:53,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,978 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:53,978 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,978 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:53,978 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:53,979 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,979 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:27:53,979 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:53,979 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:27:53,979 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:53,979 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,979 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:53,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,979 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:53,980 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,980 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:53,980 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,980 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:53,980 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,980 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:53,980 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,980 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:53,980 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:53,981 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:53,981 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:27:53,981 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:27:53,981 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:53,981 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:27:53,982 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:53,982 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:53,982 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:53,983 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:53,983 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:53,984 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:53,984 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:53,984 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:53,985 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:53,985 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:27:53,986 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:53,986 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:27:53,986 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:53,986 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,986 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:53,987 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,987 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:53,987 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,987 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:53,987 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,988 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:53,988 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,988 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:53,988 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,988 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:53,989 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:53,989 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:53,989 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 10000); {10338#false} is VALID [2018-11-23 12:27:53,989 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:27:53,989 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:27:53,990 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:53,990 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:53,990 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:53,990 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:53,996 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:54,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:54,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:27:54,016 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:54,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:54,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:54,111 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:54,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:54,113 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:27:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:54,964 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:27:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:27:54,964 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:54,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:27:55,144 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:55,146 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:27:55,146 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:27:55,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:27:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:27:55,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:55,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:55,176 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:55,176 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,178 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:55,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,178 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:55,178 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,180 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:55,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:55,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:27:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:27:55,183 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:27:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:55,183 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:27:55,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:27:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:27:55,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:55,184 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:55,184 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:55,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:27:55,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:55,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:55,844 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:55,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:55,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:55,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:55,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:55,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:55,846 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:55,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:55,847 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:55,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:55,848 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:55,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:55,849 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:55,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:55,850 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:55,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:55,852 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:55,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:55,853 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:55,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:55,854 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:55,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:55,855 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:55,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:55,857 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:55,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:55,858 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:55,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:55,859 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:55,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:55,860 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:55,861 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:55,862 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:55,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:55,863 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:55,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:55,864 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:55,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:55,866 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:55,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:55,867 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:55,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:55,868 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:55,869 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:27:55,869 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:55,869 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:55,869 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,870 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:55,870 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,870 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:55,870 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,870 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:55,871 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,871 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:55,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,871 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:55,871 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,872 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:55,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,872 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:55,872 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:55,872 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:55,872 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:55,872 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:55,872 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:55,873 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:55,873 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,873 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:55,873 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,873 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:55,873 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,873 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:55,873 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,873 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:55,874 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,874 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:55,874 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,874 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:55,874 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,874 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:55,874 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:55,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:55,874 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:55,875 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:55,875 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:55,875 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:55,875 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:55,875 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:55,875 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:55,875 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:55,875 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:55,875 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:55,876 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:55,876 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:55,876 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:55,876 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:27:55,876 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:55,876 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:27:55,876 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:55,876 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,877 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:55,877 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,877 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:55,877 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,877 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:55,877 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,877 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:55,877 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,877 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:55,878 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,878 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:55,878 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:55,878 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:55,878 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:27:55,878 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:27:55,878 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:55,878 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:55,878 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:55,879 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:55,879 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:55,885 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:55,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:55,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:56,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:56,285 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:56,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:56,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:56,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:56,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:56,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:56,288 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:56,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:56,289 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:56,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:56,289 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:56,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:56,291 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:56,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:56,292 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:56,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:56,293 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:56,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:56,294 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:56,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:56,296 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:56,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:56,297 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:56,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:56,298 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:56,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:56,299 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:56,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:56,301 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:56,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:56,302 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:56,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:56,303 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:56,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:56,305 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:56,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:56,306 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:56,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:56,307 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:56,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:56,308 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:56,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:56,310 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:56,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:27:56,311 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:56,311 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:56,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,311 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:56,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,311 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:56,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,312 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:56,312 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,312 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:56,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,313 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:56,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,313 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:56,313 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,313 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:56,314 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:56,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:56,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:56,314 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:56,314 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:56,314 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:56,315 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:56,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,315 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:56,315 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,315 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:56,315 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,315 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:56,315 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,316 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:56,316 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,316 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:56,316 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,316 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:56,316 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,316 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:56,316 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:56,316 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:56,317 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:56,317 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:56,317 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:56,317 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:56,317 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:56,317 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:56,317 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:56,317 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:56,317 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:56,318 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:56,318 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:56,318 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:56,318 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:56,318 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:27:56,318 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:56,318 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:27:56,318 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:56,318 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,319 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:56,319 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,319 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:56,319 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,319 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:56,319 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,319 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:56,319 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,319 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:56,320 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,320 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:56,320 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:56,320 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:56,320 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:27:56,320 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:27:56,320 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:56,320 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:56,321 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:56,321 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:56,321 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:56,327 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:56,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:27:56,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:56,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:56,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:27:56,424 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:56,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:27:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:27:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:56,425 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:27:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,043 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:27:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:27:57,043 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:57,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:27:57,207 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:57,209 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:27:57,209 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:27:57,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:27:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:27:57,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:57,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:57,242 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:57,242 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,244 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:57,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,245 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:57,245 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,246 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:57,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:57,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:27:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:27:57,249 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:27:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:57,250 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:27:57,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:27:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:27:57,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:57,251 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:57,251 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:57,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:27:57,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:57,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:57,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:57,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:57,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:57,994 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:57,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:57,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:57,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:57,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:57,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:57,995 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:57,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:57,996 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:57,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:57,997 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:57,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:57,998 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:57,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:57,999 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:58,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,001 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:58,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,002 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:58,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,003 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:58,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,005 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:58,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,006 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:58,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,007 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:58,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,009 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:58,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,010 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:58,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,011 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:58,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,012 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:58,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,014 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:58,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,015 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:58,015 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,016 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:58,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,018 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:58,018 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,019 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:58,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:27:58,020 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:58,020 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:58,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,020 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:58,021 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,021 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:58,021 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,021 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:58,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,022 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:58,022 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,022 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:58,022 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,022 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:58,023 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,023 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:58,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:58,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:58,023 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:58,023 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:58,024 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:58,024 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:58,024 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:58,024 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,024 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:58,024 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,024 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:58,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,025 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:58,025 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,025 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:58,025 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,025 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:58,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,025 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:58,026 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,026 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:58,026 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:58,026 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:58,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:58,026 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:58,027 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:58,027 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,027 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:58,027 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,027 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:58,028 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,028 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:58,028 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,028 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:58,028 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,028 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:58,029 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:27:58,029 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:58,029 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:27:58,029 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:58,029 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,030 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:58,030 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,030 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:58,030 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,030 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:58,031 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,031 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:58,031 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,031 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:58,032 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,032 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:58,032 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:58,032 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:58,032 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:27:58,033 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:27:58,033 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:58,033 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:58,033 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:58,033 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:58,034 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:58,051 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:58,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:58,052 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:58,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:58,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:58,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:58,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:58,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:58,402 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:58,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:58,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:58,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:58,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:58,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:58,405 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:58,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:58,406 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:58,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:58,407 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:58,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:58,408 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:58,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:58,410 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:58,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,411 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:58,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,413 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:58,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,414 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:58,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,416 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:58,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,417 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:58,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,419 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:58,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,420 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:58,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,421 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:58,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,423 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:58,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,424 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:58,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,426 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:58,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,427 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:58,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,428 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:58,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,430 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:58,431 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,431 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:58,432 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:27:58,432 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:58,433 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:58,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,433 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:58,434 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,434 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:58,434 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,435 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:58,435 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,436 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:58,436 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,436 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:58,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,436 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:58,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,437 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:58,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:58,437 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:58,437 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:58,437 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:58,438 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:58,438 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:58,438 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:58,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,438 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:58,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,439 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:58,439 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,439 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:58,439 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,439 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:58,440 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,440 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:58,440 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,440 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:58,440 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,440 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:58,441 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:58,441 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:58,441 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:58,441 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:58,441 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:58,441 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,442 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:58,442 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,442 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:58,442 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,442 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:58,443 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,443 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:58,443 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:58,443 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:58,443 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:27:58,443 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:58,444 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:27:58,444 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:58,444 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,444 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:58,444 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,444 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:58,445 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,445 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:58,445 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,445 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:58,445 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,445 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:58,445 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,446 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:58,446 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:58,446 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:58,446 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:27:58,446 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:27:58,446 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:58,447 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:58,447 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:58,447 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:58,447 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:58,481 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:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:27:58,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:58,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:58,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:58,613 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:58,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:58,614 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:27:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:59,057 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:27:59,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:27:59,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:59,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:27:59,192 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:59,195 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:27:59,195 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:27:59,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:27:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:27:59,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:59,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:59,226 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:59,226 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:59,228 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:59,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:59,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:59,229 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:59,229 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:59,231 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:59,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:59,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:59,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:59,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:27:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:27:59,233 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:27:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:59,234 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:27:59,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:27:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:27:59,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:59,235 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:59,235 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:59,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:27:59,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:59,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:00,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:28:00,661 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:28:00,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:00,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:28:00,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:28:00,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:28:00,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:28:00,663 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:28:00,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:00,664 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:28:00,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:00,664 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:28:00,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:00,666 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:28:00,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:00,667 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:28:00,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:00,668 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:28:00,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:00,669 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:28:00,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:00,671 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:28:00,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:00,672 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:28:00,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:00,673 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:28:00,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:00,674 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:28:00,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:00,676 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:28:00,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:00,677 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:28:00,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:00,678 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:28:00,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:00,680 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:28:00,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:00,681 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:28:00,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:00,682 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:28:00,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:00,683 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:28:00,684 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:00,703 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:28:00,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:00,726 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:28:00,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:00,749 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:28:00,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 10000); {12985#false} is VALID [2018-11-23 12:28:00,762 INFO L256 TraceCheckUtils]: 49: Hoare triple {12985#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:28:00,762 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:28:00,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,763 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:28:00,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,763 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:28:00,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,763 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:28:00,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,764 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:28:00,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,764 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:28:00,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,764 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:28:00,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,765 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:28:00,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:28:00,765 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:28:00,765 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:00,765 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:28:00,766 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:28:00,766 INFO L256 TraceCheckUtils]: 70: Hoare triple {12985#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:28:00,766 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:28:00,766 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,766 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:28:00,766 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,766 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:28:00,767 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,767 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:28:00,767 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,767 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:28:00,767 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,767 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:28:00,768 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,768 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:28:00,768 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,768 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:28:00,768 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:28:00,769 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:28:00,769 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:00,769 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:28:00,769 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:28:00,769 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:28:00,769 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:28:00,769 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:28:00,770 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:28:00,770 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:28:00,770 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:28:00,770 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:28:00,770 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:28:00,770 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:28:00,771 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:28:00,771 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:28:00,771 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:28:00,771 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:28:00,771 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:28:00,771 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,772 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:28:00,772 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,772 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:28:00,772 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,772 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:28:00,772 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,772 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:28:00,773 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,773 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:28:00,773 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,773 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:28:00,773 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:00,774 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:28:00,774 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:28:00,774 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:28:00,774 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:00,774 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:28:00,774 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:28:00,775 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:28:00,775 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:28:00,785 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:28:00,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:00,785 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:28:00,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:00,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:28:00,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:00,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:01,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:28:01,195 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:28:01,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:01,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:28:01,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:28:01,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:28:01,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,197 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:28:01,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,197 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:28:01,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,197 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:28:01,197 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,197 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:28:01,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,198 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:28:01,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,198 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:28:01,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,198 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:28:01,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,198 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:28:01,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,198 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:28:01,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,199 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:28:01,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,199 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:28:01,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,199 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:28:01,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,200 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:28:01,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,200 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:28:01,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,200 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:28:01,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,200 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:28:01,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,201 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:28:01,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,201 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:28:01,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,201 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:28:01,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,202 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:28:01,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:28:01,202 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:28:01,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 10000); {12984#true} is VALID [2018-11-23 12:28:01,202 INFO L256 TraceCheckUtils]: 49: Hoare triple {12984#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:28:01,202 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:28:01,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,202 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:28:01,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,203 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:28:01,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,203 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:28:01,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,203 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:28:01,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,203 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:28:01,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,204 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:28:01,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,204 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:28:01,204 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:28:01,204 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:28:01,204 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:01,204 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:28:01,205 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:28:01,205 INFO L256 TraceCheckUtils]: 70: Hoare triple {12984#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:28:01,205 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:28:01,205 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,205 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:28:01,205 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,205 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:28:01,206 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,206 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:28:01,206 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,206 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:28:01,206 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,206 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:28:01,207 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,207 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:28:01,207 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:28:01,207 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:28:01,207 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:28:01,207 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:28:01,207 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:28:01,208 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:28:01,209 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:28:01,210 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:01,210 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:28:01,210 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:01,211 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:28:01,211 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:01,212 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:28:01,212 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:01,212 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:28:01,213 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:01,213 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:28:01,213 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:28:01,214 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:28:01,214 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {12985#false} is VALID [2018-11-23 12:28:01,214 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:28:01,214 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,214 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:28:01,215 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,215 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:28:01,215 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,215 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:28:01,215 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,216 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:28:01,216 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,216 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:28:01,216 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,216 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:28:01,216 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:28:01,217 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:28:01,217 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 10000); {12985#false} is VALID [2018-11-23 12:28:01,217 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:28:01,217 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:28:01,217 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:28:01,218 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:28:01,218 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:28:01,218 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:28:01,224 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:28:01,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:28:01,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:28:01,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:01,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:01,347 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:28:01,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:01,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:01,349 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:28:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:01,949 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:28:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:28:01,949 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:28:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:28:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:28:01,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:28:02,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:02,075 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:28:02,076 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:28:02,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:28:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:28:02,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:02,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:28:02,124 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:28:02,125 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:28:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,127 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:28:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:28:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,127 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:28:02,127 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:28:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:02,129 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:28:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:28:02,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:02,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:02,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:02,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:28:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:28:02,131 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:28:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:02,131 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:28:02,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:28:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:28:02,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:02,132 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:28:02,133 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:02,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:28:02,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:02,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:02,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:02,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:28:02,818 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:28:02,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:28:02,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:28:02,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:28:02,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:28:02,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:28:02,821 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:28:02,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:02,821 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:28:02,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:02,822 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:28:02,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:02,823 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:28:02,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:02,829 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:28:02,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:02,830 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:28:02,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:02,831 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:28:02,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:02,831 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:28:02,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:02,833 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:28:02,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:02,834 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:28:02,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:02,835 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:28:02,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:02,836 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:28:02,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:02,838 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:28:02,838 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:02,839 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:28:02,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:02,840 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:28:02,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:02,841 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:28:02,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:02,843 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:28:02,843 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:02,844 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:28:02,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:02,845 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:28:02,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:02,847 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:28:02,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:02,848 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:28:02,848 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:02,849 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:28:02,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:28:02,850 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:28:02,850 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:28:02,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,851 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:28:02,851 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,851 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:28:02,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,851 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:28:02,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,852 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:28:02,852 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,852 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:28:02,852 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,852 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:28:02,853 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,853 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:28:02,853 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:28:02,853 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:28:02,853 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:28:02,853 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:28:02,854 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:28:02,854 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:28:02,854 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:28:02,854 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,854 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:28:02,855 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,855 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:28:02,855 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,855 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:28:02,855 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,855 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:28:02,855 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,855 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:28:02,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,856 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:28:02,856 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,856 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:28:02,856 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:28:02,856 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:28:02,856 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:28:02,856 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:28:02,856 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:28:02,856 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,857 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:28:02,857 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,857 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:28:02,857 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,857 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:28:02,857 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,857 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:28:02,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,857 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:28:02,858 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:02,858 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:28:02,858 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:28:02,858 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:28:02,858 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:28:02,858 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:28:02,858 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,858 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:28:02,858 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,858 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:28:02,859 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,859 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:28:02,859 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,859 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:28:02,859 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,859 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:28:02,859 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,859 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:28:02,859 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:28:02,860 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:28:02,860 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:28:02,860 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:28:02,860 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:28:02,860 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:28:02,860 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:28:02,860 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:28:02,860 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:28:02,868 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:28:02,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:02,868 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:28:02,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:02,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:02,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:02,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:03,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:28:03,267 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:28:03,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:28:03,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:28:03,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:28:03,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:03,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:03,269 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:28:03,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:03,270 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:28:03,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:03,271 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:28:03,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:03,272 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:28:03,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:03,273 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:28:03,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:03,274 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:28:03,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:03,276 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:28:03,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:03,277 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:28:03,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:03,278 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:28:03,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:03,279 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:28:03,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:03,281 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:28:03,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:03,282 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:28:03,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:03,283 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:28:03,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:03,285 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:28:03,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:03,286 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:28:03,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:03,287 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:28:03,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:03,288 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:28:03,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:03,290 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:28:03,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:03,291 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:28:03,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:03,292 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:28:03,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:03,293 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:28:03,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:03,295 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:28:03,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:28:03,295 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:28:03,296 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:28:03,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,296 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:28:03,296 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,296 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:28:03,297 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,297 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:28:03,297 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,297 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:28:03,297 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,298 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:28:03,298 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,298 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:28:03,298 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,298 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:28:03,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:28:03,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:28:03,298 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:28:03,298 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:28:03,299 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:28:03,299 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:28:03,299 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:28:03,299 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,299 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:28:03,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,299 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:28:03,299 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,299 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:28:03,299 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,300 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:28:03,300 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,300 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:28:03,300 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,300 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:28:03,300 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,300 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:28:03,300 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:28:03,300 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:28:03,301 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:28:03,301 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:28:03,301 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:28:03,301 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,301 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:28:03,301 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,301 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:28:03,301 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,301 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:28:03,302 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,302 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:28:03,302 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,302 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:28:03,302 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:28:03,302 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:28:03,302 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:28:03,302 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:28:03,302 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:28:03,303 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:28:03,303 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,303 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:28:03,303 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,303 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:28:03,303 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,303 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:28:03,303 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,303 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:28:03,303 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,304 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:28:03,304 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,304 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:28:03,304 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:28:03,304 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:28:03,304 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:28:03,304 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:28:03,304 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:28:03,304 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:28:03,305 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:28:03,305 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:28:03,305 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:28:03,315 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:28:03,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:28:03,340 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:28:03,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:03,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:28:03,429 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:28:03,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:28:03,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:28:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:28:03,431 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:28:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,439 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:28:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:28:04,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:28:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:28:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:28:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:28:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:28:04,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:28:04,536 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:28:04,538 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:28:04,538 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:28:04,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:28:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:28:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:28:04,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:04,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:04,582 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:04,583 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,585 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:28:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:28:04,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:04,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:04,586 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:28:04,586 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:28:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:04,588 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:28:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:28:04,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:04,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:04,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:04,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:28:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:28:04,591 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:28:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:04,591 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:28:04,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:28:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:28:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:28:04,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:04,592 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:28:04,592 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:04,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:28:04,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:04,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:04,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:05,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:28:05,702 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:05,702 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:05,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:28:05,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:28:05,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:28:05,705 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:28:05,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:05,706 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:28:05,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:05,707 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:28:05,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:05,708 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:28:05,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:05,709 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:28:05,709 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:05,710 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:28:05,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:05,711 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:28:05,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:05,712 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:28:05,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:05,713 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:28:05,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:05,715 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:28:05,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:05,716 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:28:05,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:05,717 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:28:05,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:05,718 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:28:05,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:05,719 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:28:05,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:05,720 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:28:05,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:05,722 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:28:05,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:05,723 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:28:05,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:05,724 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:28:05,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:05,725 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:28:05,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:05,726 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:28:05,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:05,728 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:28:05,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:05,729 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:28:05,729 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:05,730 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:28:05,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 10000); {14873#false} is VALID [2018-11-23 12:28:05,731 INFO L256 TraceCheckUtils]: 53: Hoare triple {14873#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:28:05,731 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:05,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,732 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:05,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,732 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:05,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,732 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:05,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,733 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:05,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,733 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:05,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,733 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:05,733 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,734 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:05,734 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:28:05,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:28:05,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:05,734 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:28:05,734 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:28:05,734 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:28:05,734 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:05,734 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,735 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:05,735 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,735 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:05,735 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,735 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:05,735 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,735 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:05,735 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,735 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:05,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,736 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:05,736 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,736 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:05,736 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:28:05,736 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:28:05,736 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:05,736 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:28:05,736 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:28:05,736 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,737 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:28:05,737 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,737 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:28:05,737 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,737 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:28:05,737 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,737 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:28:05,737 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,737 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:28:05,738 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:05,738 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:28:05,738 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:28:05,738 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:28:05,738 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:28:05,738 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:28:05,738 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,738 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:28:05,738 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,738 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:28:05,739 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,739 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:28:05,739 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,739 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:28:05,739 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,739 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:28:05,739 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,739 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:28:05,739 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:05,740 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:28:05,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:28:05,740 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:28:05,740 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:05,740 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:28:05,740 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:05,740 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:05,740 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:28:05,748 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:28:05,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:05,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:28:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:07,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:28:07,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:07,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:07,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:28:07,946 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:07,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:07,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:28:07,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:28:07,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:28:07,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,947 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:07,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,948 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:07,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,948 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:07,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,948 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:07,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,948 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:07,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,948 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:07,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,949 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:07,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,949 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:07,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,949 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:07,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,949 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:07,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,950 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:07,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,950 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:07,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,950 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:07,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,950 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:07,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,950 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:07,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,951 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:07,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,951 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:07,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,951 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:07,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,951 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:07,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,951 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:07,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,952 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:07,952 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,952 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:07,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:07,952 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:07,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 10000); {14872#true} is VALID [2018-11-23 12:28:07,952 INFO L256 TraceCheckUtils]: 53: Hoare triple {14872#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:28:07,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15063#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:07,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15063#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:07,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {15063#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15070#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:07,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15070#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:07,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {15070#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15077#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:07,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15077#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:07,956 INFO L273 TraceCheckUtils]: 60: Hoare triple {15077#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15084#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:07,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15084#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:07,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {15084#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15091#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:07,957 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15091#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:07,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {15091#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15098#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:07,959 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15098#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:07,959 INFO L273 TraceCheckUtils]: 66: Hoare triple {15098#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15105#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:07,960 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= mapsum_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15105#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:07,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {15105#(<= mapsum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15112#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:07,961 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= mapsum_~i~0 7)} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:28:07,961 INFO L273 TraceCheckUtils]: 70: Hoare triple {14873#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:28:07,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:07,962 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:28:07,962 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:28:07,962 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:28:07,962 INFO L273 TraceCheckUtils]: 75: Hoare triple {14873#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 77: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 85: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,964 INFO L273 TraceCheckUtils]: 87: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {14873#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L273 TraceCheckUtils]: 91: Hoare triple {14873#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:07,965 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:28:07,965 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:28:07,965 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,965 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:28:07,966 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,966 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:28:07,966 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,966 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:28:07,966 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,966 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:28:07,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,966 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:28:07,966 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:07,966 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:28:07,967 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:28:07,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:28:07,967 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:28:07,967 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:07,967 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,967 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:07,967 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,967 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:07,967 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,968 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:07,968 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,968 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:07,968 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,968 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:07,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,968 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:07,968 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:07,968 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:07,968 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:28:07,969 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:28:07,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:07,969 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:28:07,969 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:07,969 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:07,969 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:28:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2018-11-23 12:28:08,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:08,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:28:08,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:28:08,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:08,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:28:08,222 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:08,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:28:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:28:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:08,223 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:28:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,206 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:28:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:09,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:28:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:28:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:28:09,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:28:09,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:09,426 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:28:09,428 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:28:09,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:28:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:28:09,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:09,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:09,479 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:09,479 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,481 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:09,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:09,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:09,482 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:09,482 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:09,484 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:09,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:09,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:09,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:09,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:28:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:28:09,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:28:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:09,488 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:28:09,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:28:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:28:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:28:09,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:09,489 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:09,489 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:09,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:28:09,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:09,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:10,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:28:10,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:28:10,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:10,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:28:10,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:28:10,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:28:10,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:28:10,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {15864#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:10,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:10,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {15865#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:10,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {15866#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:10,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {15867#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:10,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {15868#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:10,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {15869#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:10,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {15870#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,140 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:10,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {15871#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:10,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {15872#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,169 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:10,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {15873#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,170 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:10,171 INFO L273 TraceCheckUtils]: 27: Hoare triple {15874#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:10,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {15875#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:10,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:10,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {15876#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:10,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:10,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {15877#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:10,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:10,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {15878#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:10,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:10,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {15879#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:10,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:10,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {15880#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:10,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:10,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {15881#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:10,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:10,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {15882#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:10,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:10,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {15883#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:10,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:10,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {15884#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:10,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:10,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {15885#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:10,184 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:10,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {15886#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:10,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:10,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {15887#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15888#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:10,186 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 10000); {15863#false} is VALID [2018-11-23 12:28:10,187 INFO L256 TraceCheckUtils]: 55: Hoare triple {15863#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:28:10,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:28:10,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,187 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,189 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:10,190 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 77: Hoare triple {15863#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:28:10,191 INFO L256 TraceCheckUtils]: 78: Hoare triple {15863#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,191 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,192 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:10,193 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 100: Hoare triple {15863#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {15863#false} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 102: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,193 INFO L273 TraceCheckUtils]: 104: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 106: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 108: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 110: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 112: Hoare triple {15863#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:28:10,194 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:28:10,195 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 116: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 118: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 120: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 122: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,195 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 124: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 126: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 128: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 130: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 132: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:10,196 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:28:10,197 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:28:10,197 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:10,197 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:28:10,197 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15863#false} is VALID [2018-11-23 12:28:10,197 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:28:10,197 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:28:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:28:10,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:10,207 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:10,215 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:11,579 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:28:11,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:12,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:28:12,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:28:12,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:12,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:28:12,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:28:12,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:28:12,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 33: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,519 INFO L273 TraceCheckUtils]: 37: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 45: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,520 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 47: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {15862#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 10000); {15862#true} is VALID [2018-11-23 12:28:12,521 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,522 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:28:12,523 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 77: Hoare triple {15862#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L256 TraceCheckUtils]: 78: Hoare triple {15862#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,524 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,525 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:12,526 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:28:12,527 INFO L273 TraceCheckUtils]: 100: Hoare triple {15862#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:12,527 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:12,527 INFO L273 TraceCheckUtils]: 102: Hoare triple {16192#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:12,528 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:12,528 INFO L273 TraceCheckUtils]: 104: Hoare triple {16199#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:12,528 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:12,529 INFO L273 TraceCheckUtils]: 106: Hoare triple {16206#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:12,529 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:12,530 INFO L273 TraceCheckUtils]: 108: Hoare triple {16213#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:12,530 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:12,531 INFO L273 TraceCheckUtils]: 110: Hoare triple {16220#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:12,531 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:12,532 INFO L273 TraceCheckUtils]: 112: Hoare triple {16227#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16234#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:12,532 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L273 TraceCheckUtils]: 116: Hoare triple {15863#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L273 TraceCheckUtils]: 118: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 120: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 122: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 124: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,534 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 126: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 128: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 130: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,535 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:12,536 INFO L273 TraceCheckUtils]: 132: Hoare triple {15863#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15863#false} is VALID [2018-11-23 12:28:12,536 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 10000); {15863#false} is VALID [2018-11-23 12:28:12,536 INFO L273 TraceCheckUtils]: 134: Hoare triple {15863#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15863#false} is VALID [2018-11-23 12:28:12,536 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:28:12,536 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:28:12,537 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15863#false} is VALID [2018-11-23 12:28:12,537 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:28:12,537 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:28:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2018-11-23 12:28:12,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:12,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:28:12,566 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:28:12,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:12,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:28:13,205 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:13,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:28:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:28:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:13,207 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:28:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:14,278 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:28:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:14,278 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:28:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:14,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:28:14,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:14,401 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:28:14,401 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:28:14,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:28:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:28:14,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:14,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:14,455 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:14,455 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:14,457 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:14,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:14,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:14,458 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:14,458 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:14,460 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:14,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:14,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:14,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:14,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:28:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:28:14,463 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:28:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:14,463 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:28:14,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:28:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:28:14,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:14,465 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:14,465 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:14,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:28:14,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:14,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:15,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:15,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:28:15,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:15,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:15,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:15,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:15,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:15,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {16901#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:15,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:15,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:15,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:15,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:15,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:15,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:15,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:15,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:15,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:15,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:15,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:15,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:15,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:15,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:15,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:15,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:15,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:15,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:15,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:15,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:15,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:15,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:15,029 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:15,029 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:15,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:15,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:15,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:15,032 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:15,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:15,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:15,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:15,034 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:15,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:15,035 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:15,036 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:15,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:15,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:15,037 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:15,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:15,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:15,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:15,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:15,040 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:15,041 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:15,042 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:15,042 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:15,043 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:15,044 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:15,044 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:28:15,044 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:15,045 INFO L273 TraceCheckUtils]: 58: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:15,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,046 INFO L273 TraceCheckUtils]: 68: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 70: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,047 INFO L273 TraceCheckUtils]: 74: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,048 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:15,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {16899#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:15,048 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:15,048 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:15,048 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:15,049 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 81: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 83: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 85: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 87: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,049 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 89: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 91: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 93: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 95: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 97: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,050 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 99: Hoare triple {16899#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:15,051 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,051 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,052 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:15,053 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 120: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 122: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 124: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,053 INFO L273 TraceCheckUtils]: 126: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 128: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 130: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 132: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 134: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16899#true} is VALID [2018-11-23 12:28:15,054 INFO L273 TraceCheckUtils]: 136: Hoare triple {16899#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16899#true} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 138: Hoare triple {16899#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:15,055 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16900#false} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:28:15,055 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:15,064 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:15,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:15,065 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:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:15,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:15,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:15,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:28:15,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:15,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:15,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:15,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:15,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:15,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {16945#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:15,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:15,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:15,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:15,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:15,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:15,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:15,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:15,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:15,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:15,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:15,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:15,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:15,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:15,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:15,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:15,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:15,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:15,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:15,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:15,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:15,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:15,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:15,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:15,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:15,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:15,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:15,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:15,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:15,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:15,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:15,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:15,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:15,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:15,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:15,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:15,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:15,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:15,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:15,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:15,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:15,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:15,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:15,415 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:15,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:15,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:15,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:15,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:15,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:15,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:28:15,419 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:15,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:15,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {16900#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:15,422 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L273 TraceCheckUtils]: 81: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L273 TraceCheckUtils]: 83: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,423 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 85: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 89: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 91: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 93: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,424 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 95: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 97: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 99: Hoare triple {16900#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:28:15,425 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,426 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 120: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,427 INFO L273 TraceCheckUtils]: 122: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 124: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 126: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 128: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 130: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,428 INFO L273 TraceCheckUtils]: 132: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 134: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 136: Hoare triple {16900#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 138: Hoare triple {16900#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16900#false} is VALID [2018-11-23 12:28:15,429 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:28:15,430 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:15,439 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:15,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:15,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:28:15,459 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:15,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:15,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:28:15,546 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:15,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:28:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:28:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:15,547 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:28:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,278 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:28:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:28:16,278 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:16,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:28:16,380 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:16,382 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:28:16,382 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:28:16,383 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:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:28:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:28:16,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:16,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:16,417 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:16,417 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,419 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:16,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,421 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:16,421 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:16,422 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:16,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:16,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:16,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:16,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:28:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:28:16,425 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:28:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:16,426 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:28:16,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:28:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:28:16,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:16,427 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:16,427 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:16,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:28:16,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:16,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:16,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:16,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:17,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:28:17,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:17,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:17,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:17,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {17955#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,128 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,130 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,131 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,135 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,136 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,139 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,144 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:17,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:28:17,148 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:17,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:17,149 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,149 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,150 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,151 INFO L273 TraceCheckUtils]: 70: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,152 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,153 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:17,153 INFO L273 TraceCheckUtils]: 78: Hoare triple {17953#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:17,153 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:17,153 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:17,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:17,153 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:17,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,154 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 93: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 95: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 97: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,155 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 99: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 101: Hoare triple {17953#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:17,156 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:28:17,156 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,157 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:28:17,158 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:17,159 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 122: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 124: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 126: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,159 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 128: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 130: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 132: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,160 INFO L273 TraceCheckUtils]: 134: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 136: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 138: Hoare triple {17953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 140: Hoare triple {17953#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:28:17,161 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:17,162 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:17,162 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17954#false} is VALID [2018-11-23 12:28:17,162 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:28:17,162 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:17,202 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:17,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:17,202 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:17,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:17,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:17,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:17,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:17,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:28:17,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:17,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:17,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:17,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:17,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:17,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {18000#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,574 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,576 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,577 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,578 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,579 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,581 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,584 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,585 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:17,585 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:28:17,585 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 62: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 64: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,586 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 66: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 68: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 70: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,587 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 72: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 74: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 76: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,588 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L273 TraceCheckUtils]: 78: Hoare triple {17954#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:17,589 INFO L273 TraceCheckUtils]: 83: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 85: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 87: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,590 INFO L273 TraceCheckUtils]: 89: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 93: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 95: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 97: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,591 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 99: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 101: Hoare triple {17954#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,592 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,593 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 122: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 124: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 126: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,594 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 128: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 130: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 132: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 134: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 136: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,595 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 138: Hoare triple {17954#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 140: Hoare triple {17954#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:28:17,596 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:17,606 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:17,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:17,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:28:17,625 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:17,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:17,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:17,712 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:17,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:17,713 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:28:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:18,491 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:28:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:28:18,492 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:18,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:28:18,628 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:18,630 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:28:18,630 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:28:18,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:28:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:28:18,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:18,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:18,679 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:18,681 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:18,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:18,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:18,682 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:18,682 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:18,684 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:18,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:18,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:18,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:18,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:28:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:28:18,686 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:28:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:18,687 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:28:18,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:28:18,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:18,688 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:18,688 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:18,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:18,688 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:28:18,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:18,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:18,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:19,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:19,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:28:19,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:19,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:19,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:19,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:19,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:19,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {19026#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:19,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:19,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {19027#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:19,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:19,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {19028#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:19,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:19,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {19029#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:19,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:19,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {19030#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:19,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:19,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {19031#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:19,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:19,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {19032#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:19,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:19,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {19033#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:19,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:19,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {19034#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:19,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:19,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {19035#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:19,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:19,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {19036#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:19,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:19,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {19037#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:19,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:19,942 INFO L273 TraceCheckUtils]: 31: Hoare triple {19038#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:19,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:19,943 INFO L273 TraceCheckUtils]: 33: Hoare triple {19039#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:19,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:19,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {19040#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:19,945 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:19,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {19041#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:19,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:19,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {19042#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:19,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:19,948 INFO L273 TraceCheckUtils]: 41: Hoare triple {19043#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:19,949 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:19,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {19044#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:19,950 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:19,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {19045#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:19,951 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:19,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {19046#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:19,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:19,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {19047#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:19,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:19,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {19048#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:19,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:19,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {19049#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:19,956 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:19,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {19050#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:19,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:19,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {19051#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:19,959 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:19,959 INFO L273 TraceCheckUtils]: 59: Hoare triple {19052#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19053#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:19,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 10000); {19025#false} is VALID [2018-11-23 12:28:19,960 INFO L256 TraceCheckUtils]: 61: Hoare triple {19025#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:19,960 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,961 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,962 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:19,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:19,964 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:19,964 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:28:19,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {19025#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:19,964 INFO L256 TraceCheckUtils]: 84: Hoare triple {19025#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:19,964 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,965 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:19,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:19,967 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 106: Hoare triple {19025#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 110: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,967 INFO L273 TraceCheckUtils]: 112: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 114: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 116: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 118: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 120: Hoare triple {19025#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:28:19,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:19,969 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 124: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 126: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 128: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 130: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,969 INFO L273 TraceCheckUtils]: 132: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 134: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 136: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 138: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 140: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:19,970 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:19,971 INFO L273 TraceCheckUtils]: 142: Hoare triple {19024#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:19,971 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:19,971 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:19,971 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19025#false} is VALID [2018-11-23 12:28:19,971 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:28:19,971 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:19,981 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:19,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:19,981 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:19,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:20,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:28:20,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:20,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:20,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:20,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:28:20,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:20,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:20,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:20,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,436 INFO L273 TraceCheckUtils]: 29: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 33: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,437 INFO L273 TraceCheckUtils]: 39: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 41: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 43: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 55: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 57: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,439 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 59: Hoare triple {19024#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 10000); {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L256 TraceCheckUtils]: 61: Hoare triple {19024#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,440 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,441 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 83: Hoare triple {19024#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L256 TraceCheckUtils]: 84: Hoare triple {19024#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,442 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,443 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:20,444 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:28:20,445 INFO L273 TraceCheckUtils]: 106: Hoare triple {19024#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:20,445 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:20,446 INFO L273 TraceCheckUtils]: 108: Hoare triple {19375#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:20,446 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:20,446 INFO L273 TraceCheckUtils]: 110: Hoare triple {19382#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:20,447 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:20,447 INFO L273 TraceCheckUtils]: 112: Hoare triple {19389#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:20,447 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:20,448 INFO L273 TraceCheckUtils]: 114: Hoare triple {19396#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:20,448 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:20,449 INFO L273 TraceCheckUtils]: 116: Hoare triple {19403#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:20,449 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:20,450 INFO L273 TraceCheckUtils]: 118: Hoare triple {19410#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:20,450 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:20,451 INFO L273 TraceCheckUtils]: 120: Hoare triple {19417#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {19424#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:20,451 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L273 TraceCheckUtils]: 124: Hoare triple {19025#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L273 TraceCheckUtils]: 126: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,452 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,453 INFO L273 TraceCheckUtils]: 128: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,453 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,453 INFO L273 TraceCheckUtils]: 130: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,453 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,453 INFO L273 TraceCheckUtils]: 132: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,454 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,454 INFO L273 TraceCheckUtils]: 134: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,454 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,454 INFO L273 TraceCheckUtils]: 136: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,454 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 138: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 140: Hoare triple {19025#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 10000); {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 142: Hoare triple {19025#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19025#false} is VALID [2018-11-23 12:28:20,455 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:28:20,456 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:20,456 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {19025#false} is VALID [2018-11-23 12:28:20,456 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:28:20,456 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:20,467 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:20,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:20,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:28:20,500 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:20,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:20,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:28:20,649 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:20,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:28:20,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:28:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:20,651 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:28:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,623 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:28:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:28:21,624 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:21,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:28:21,742 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:21,744 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:28:21,745 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:28:21,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:28:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:28:21,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:21,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:21,903 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:21,903 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,907 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:21,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,908 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:21,908 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,910 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:21,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:21,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:28:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:28:21,913 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:28:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:21,913 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:28:21,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:28:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:28:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:28:21,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:21,915 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:21,915 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:21,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:28:21,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:21,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:22,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:22,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:28:22,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:22,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:22,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:22,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:22,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {20134#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:22,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:22,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {20135#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:22,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:22,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {20136#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:22,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:22,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {20137#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:22,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:22,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {20138#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:22,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:22,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {20139#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:22,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:22,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {20140#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:22,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:22,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {20141#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:22,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:22,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:22,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:22,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:22,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:22,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:22,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:22,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {20145#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:22,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:22,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {20146#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:22,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:22,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {20147#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:22,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:22,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {20148#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:22,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:22,496 INFO L273 TraceCheckUtils]: 37: Hoare triple {20149#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:22,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:22,497 INFO L273 TraceCheckUtils]: 39: Hoare triple {20150#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:22,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:22,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {20151#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:22,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:22,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {20152#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:22,500 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:22,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {20153#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:22,501 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:22,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {20154#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:22,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:22,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {20155#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:22,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:22,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {20156#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:22,505 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:22,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {20157#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:22,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:22,507 INFO L273 TraceCheckUtils]: 55: Hoare triple {20158#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:22,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:22,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {20159#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:22,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:22,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {20160#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:22,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:22,510 INFO L273 TraceCheckUtils]: 61: Hoare triple {20161#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20162#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:22,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 10000); {20133#false} is VALID [2018-11-23 12:28:22,511 INFO L256 TraceCheckUtils]: 63: Hoare triple {20133#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,511 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:22,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,512 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,513 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,514 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:28:22,514 INFO L273 TraceCheckUtils]: 85: Hoare triple {20133#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:28:22,515 INFO L256 TraceCheckUtils]: 86: Hoare triple {20133#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,515 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,516 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,517 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 108: Hoare triple {20133#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 110: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 112: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 114: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,517 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 116: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 118: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 120: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 122: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20133#false} is VALID [2018-11-23 12:28:22,518 INFO L273 TraceCheckUtils]: 124: Hoare triple {20133#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20133#false} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 9999); {20133#false} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:28:22,519 INFO L256 TraceCheckUtils]: 127: Hoare triple {20133#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 130: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 132: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,519 INFO L273 TraceCheckUtils]: 134: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 136: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 138: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 140: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 142: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,520 INFO L273 TraceCheckUtils]: 144: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 146: Hoare triple {20132#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,521 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20133#false} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:28:22,521 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:22,532 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:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:22,532 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:22,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:22,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:22,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:22,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:22,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:22,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:28:22,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 37: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 41: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,944 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 43: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 45: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 47: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 49: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,945 INFO L273 TraceCheckUtils]: 51: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 53: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 55: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 57: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 59: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20132#true} is VALID [2018-11-23 12:28:22,946 INFO L273 TraceCheckUtils]: 61: Hoare triple {20132#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L256 TraceCheckUtils]: 63: Hoare triple {20132#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,947 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,948 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L273 TraceCheckUtils]: 85: Hoare triple {20132#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L256 TraceCheckUtils]: 86: Hoare triple {20132#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20132#true} is VALID [2018-11-23 12:28:22,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,950 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:28:22,951 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 108: Hoare triple {20132#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 110: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 112: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 114: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,952 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 116: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 118: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 120: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 122: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 124: Hoare triple {20132#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {20132#true} is VALID [2018-11-23 12:28:22,953 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 9999); {20132#true} is VALID [2018-11-23 12:28:22,954 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:28:22,954 INFO L256 TraceCheckUtils]: 127: Hoare triple {20132#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:28:22,954 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {20550#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:22,955 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20550#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:22,955 INFO L273 TraceCheckUtils]: 130: Hoare triple {20550#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20557#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:22,955 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20557#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:22,956 INFO L273 TraceCheckUtils]: 132: Hoare triple {20557#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20564#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:22,956 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20564#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:22,956 INFO L273 TraceCheckUtils]: 134: Hoare triple {20564#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20571#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:22,957 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20571#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:22,957 INFO L273 TraceCheckUtils]: 136: Hoare triple {20571#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20578#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:22,957 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20578#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:22,958 INFO L273 TraceCheckUtils]: 138: Hoare triple {20578#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20585#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:22,959 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20585#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:22,959 INFO L273 TraceCheckUtils]: 140: Hoare triple {20585#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20592#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:22,960 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= mapsum_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20592#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:22,961 INFO L273 TraceCheckUtils]: 142: Hoare triple {20592#(<= mapsum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20599#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:22,961 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= mapsum_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20599#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:22,962 INFO L273 TraceCheckUtils]: 144: Hoare triple {20599#(<= mapsum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20606#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:28:22,962 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= mapsum_~i~0 8)} assume !(~i~0 < 10000); {20133#false} is VALID [2018-11-23 12:28:22,963 INFO L273 TraceCheckUtils]: 146: Hoare triple {20133#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20133#false} is VALID [2018-11-23 12:28:22,963 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:28:22,963 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:28:22,963 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {20133#false} is VALID [2018-11-23 12:28:22,963 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:28:22,964 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:22,974 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:22,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:22,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:28:22,995 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:22,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:22,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:28:23,114 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:23,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:28:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:28:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:23,116 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:28:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,712 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:28:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:23,712 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:23,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:28:23,842 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:23,845 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:28:23,845 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:28:23,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:28:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:28:23,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:23,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:23,899 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:23,899 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,901 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:23,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,902 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:23,902 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:23,904 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:23,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:23,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:23,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:23,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:28:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:28:23,907 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:28:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:23,907 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:28:23,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:28:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:28:23,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:23,909 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:23,909 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:23,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:28:23,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:24,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:24,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:28:24,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:24,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:24,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:24,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:24,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:24,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {21279#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:24,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:24,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {21280#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:24,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:24,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {21281#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:24,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:24,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {21282#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:24,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:24,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {21283#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:24,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:24,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {21284#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:24,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:24,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {21285#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:24,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:24,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {21286#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:24,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:24,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {21287#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:24,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:24,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {21288#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:24,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:24,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {21289#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:24,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:24,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {21290#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:24,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:24,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {21291#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:24,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:24,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {21292#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:24,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:24,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {21293#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:24,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:24,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {21294#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:24,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:24,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {21295#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:24,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:24,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {21296#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:24,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:24,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {21297#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:24,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {21298#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:24,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {21299#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:24,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {21300#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:24,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:24,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {21301#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:24,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:24,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {21302#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:24,778 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:24,779 INFO L273 TraceCheckUtils]: 55: Hoare triple {21303#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:24,779 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:24,780 INFO L273 TraceCheckUtils]: 57: Hoare triple {21304#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:24,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:24,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {21305#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:24,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:24,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {21306#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:24,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:24,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {21307#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21308#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:24,784 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 10000); {21278#false} is VALID [2018-11-23 12:28:24,784 INFO L256 TraceCheckUtils]: 65: Hoare triple {21278#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:24,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:24,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 72: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,786 INFO L273 TraceCheckUtils]: 76: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 80: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 82: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,787 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {21277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:24,788 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 91: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,788 INFO L273 TraceCheckUtils]: 93: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 101: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,789 INFO L273 TraceCheckUtils]: 103: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 107: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 109: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 111: Hoare triple {21277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:24,790 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:24,791 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,791 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:24,792 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:24,793 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 134: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 136: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 138: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 140: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,793 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 142: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 144: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 146: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 148: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,794 INFO L273 TraceCheckUtils]: 150: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 152: Hoare triple {21277#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 154: Hoare triple {21277#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:24,795 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21278#false} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:28:24,795 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:24,807 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:24,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:24,807 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:24,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:34,206 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:28:34,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:34,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:34,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:28:34,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:34,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:34,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 55: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 10000); {21277#true} is VALID [2018-11-23 12:28:34,960 INFO L256 TraceCheckUtils]: 65: Hoare triple {21277#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:28:34,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21510#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:34,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21510#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:34,962 INFO L273 TraceCheckUtils]: 68: Hoare triple {21510#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21517#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:34,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21517#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:34,962 INFO L273 TraceCheckUtils]: 70: Hoare triple {21517#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21524#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:34,963 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21524#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:34,963 INFO L273 TraceCheckUtils]: 72: Hoare triple {21524#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21531#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:34,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21531#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:34,964 INFO L273 TraceCheckUtils]: 74: Hoare triple {21531#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21538#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:34,965 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21538#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:34,965 INFO L273 TraceCheckUtils]: 76: Hoare triple {21538#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21545#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:34,966 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21545#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:34,967 INFO L273 TraceCheckUtils]: 78: Hoare triple {21545#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21552#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:34,967 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= mapsum_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21552#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:34,968 INFO L273 TraceCheckUtils]: 80: Hoare triple {21552#(<= mapsum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21559#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:34,969 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= mapsum_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21559#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:34,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {21559#(<= mapsum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21566#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:28:34,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= mapsum_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21566#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:28:34,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {21566#(<= mapsum_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21573#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:28:34,972 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= mapsum_~i~0 9)} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:34,972 INFO L273 TraceCheckUtils]: 86: Hoare triple {21278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21278#false} is VALID [2018-11-23 12:28:34,973 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 93: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 95: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 97: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 99: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,974 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 101: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 103: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 105: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 107: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 109: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,975 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 111: Hoare triple {21278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,976 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,977 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 134: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 136: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,978 INFO L273 TraceCheckUtils]: 138: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 140: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 142: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 144: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 146: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,979 INFO L273 TraceCheckUtils]: 148: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 150: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 152: Hoare triple {21278#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 154: Hoare triple {21278#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:34,980 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {21278#false} is VALID [2018-11-23 12:28:34,981 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:28:34,981 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:34,990 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:35,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:28:35,015 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:35,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:35,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:35,147 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:35,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:35,150 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:28:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:36,135 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:28:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:36,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:36,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:28:36,274 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:36,277 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:28:36,278 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:28:36,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:28:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:28:36,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:36,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:36,329 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:36,329 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:36,332 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:36,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:36,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:36,333 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:36,333 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:36,335 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:36,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:36,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:36,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:28:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:28:36,338 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:28:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:36,339 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:28:36,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:28:36,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:36,340 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:36,340 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:36,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:28:36,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:36,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:36,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:36,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:36,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:28:36,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:36,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:36,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:36,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:36,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:36,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {22473#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:36,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:36,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {22474#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:36,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:36,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {22475#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:36,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:36,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {22476#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:36,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:36,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {22477#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:36,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:36,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {22478#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:36,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:36,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {22479#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:36,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:36,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {22480#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:36,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:36,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {22481#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:36,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:36,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {22482#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:36,965 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:36,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {22483#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:36,966 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:36,967 INFO L273 TraceCheckUtils]: 29: Hoare triple {22484#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:36,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:36,968 INFO L273 TraceCheckUtils]: 31: Hoare triple {22485#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:36,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:36,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {22486#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:36,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:36,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {22487#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:36,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:36,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {22488#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:36,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:36,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {22489#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:36,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:36,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {22490#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:36,975 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:36,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {22491#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:36,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:36,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {22492#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:36,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:36,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {22493#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:36,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:36,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {22494#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:36,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:36,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {22495#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:36,981 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:36,982 INFO L273 TraceCheckUtils]: 53: Hoare triple {22496#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:36,983 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:36,983 INFO L273 TraceCheckUtils]: 55: Hoare triple {22497#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:36,984 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:36,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {22498#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:36,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:36,986 INFO L273 TraceCheckUtils]: 59: Hoare triple {22499#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:36,986 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:36,987 INFO L273 TraceCheckUtils]: 61: Hoare triple {22500#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:36,988 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:36,988 INFO L273 TraceCheckUtils]: 63: Hoare triple {22501#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:36,989 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:36,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {22502#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22503#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:36,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 10000); {22472#false} is VALID [2018-11-23 12:28:36,991 INFO L256 TraceCheckUtils]: 67: Hoare triple {22472#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,992 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,993 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,994 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:36,995 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 93: Hoare triple {22472#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:36,995 INFO L256 TraceCheckUtils]: 94: Hoare triple {22472#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:36,995 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,996 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,997 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:36,998 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 120: Hoare triple {22472#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {22472#false} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 122: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,998 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 124: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 126: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 128: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 130: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 132: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:36,999 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 134: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 136: Hoare triple {22472#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:37,000 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 140: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,000 INFO L273 TraceCheckUtils]: 142: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 144: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 146: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 148: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 150: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,001 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 152: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 154: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 156: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 158: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:37,002 INFO L273 TraceCheckUtils]: 160: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 162: Hoare triple {22471#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:37,003 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22472#false} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:28:37,003 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:37,016 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:37,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:37,017 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:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:38,084 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:28:38,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:38,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:38,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:28:38,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:38,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:38,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:38,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22471#true} is VALID [2018-11-23 12:28:38,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 35: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 43: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 47: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 49: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 55: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 57: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 59: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 63: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 65: Hoare triple {22471#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 10000); {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L256 TraceCheckUtils]: 67: Hoare triple {22471#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,637 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:38,638 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {22471#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L256 TraceCheckUtils]: 94: Hoare triple {22471#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,639 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,640 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:38,641 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:28:38,642 INFO L273 TraceCheckUtils]: 120: Hoare triple {22471#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:38,642 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:38,643 INFO L273 TraceCheckUtils]: 122: Hoare triple {22867#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:38,643 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:38,643 INFO L273 TraceCheckUtils]: 124: Hoare triple {22874#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:38,644 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:38,644 INFO L273 TraceCheckUtils]: 126: Hoare triple {22881#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:38,644 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:38,645 INFO L273 TraceCheckUtils]: 128: Hoare triple {22888#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:38,645 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:38,646 INFO L273 TraceCheckUtils]: 130: Hoare triple {22895#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:38,646 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:38,647 INFO L273 TraceCheckUtils]: 132: Hoare triple {22902#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:38,647 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:38,648 INFO L273 TraceCheckUtils]: 134: Hoare triple {22909#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:38,649 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:38,649 INFO L273 TraceCheckUtils]: 136: Hoare triple {22916#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {22923#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:38,650 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:28:38,650 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:38,650 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {22472#false} is VALID [2018-11-23 12:28:38,650 INFO L273 TraceCheckUtils]: 140: Hoare triple {22472#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 142: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 144: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,651 INFO L273 TraceCheckUtils]: 146: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,652 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,652 INFO L273 TraceCheckUtils]: 148: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,652 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,652 INFO L273 TraceCheckUtils]: 150: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,652 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 152: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 154: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 156: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,653 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 158: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 160: Hoare triple {22472#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 10000); {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 162: Hoare triple {22472#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:28:38,654 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:38,655 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {22472#false} is VALID [2018-11-23 12:28:38,655 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:28:38,655 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:38,665 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:38,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:28:38,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:38,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:38,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:38,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:38,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:38,807 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:28:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,020 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:28:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:40,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:40,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:28:40,179 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:40,181 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:28:40,181 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:28:40,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:28:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:28:40,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:40,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:40,231 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:40,231 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,234 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:40,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,235 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:40,235 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,237 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:40,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:40,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:28:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:28:40,240 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:28:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:40,240 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:28:40,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:28:40,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:40,242 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:40,242 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:40,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:28:40,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:40,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:40,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:41,116 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:28:41,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:41,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:41,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:41,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:41,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:41,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {23714#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,130 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,141 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,141 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,158 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,158 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,159 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:41,159 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:41,160 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:41,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:41,161 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:41,162 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:41,163 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:41,163 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:28:41,164 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:41,164 INFO L273 TraceCheckUtils]: 70: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:41,164 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,164 INFO L273 TraceCheckUtils]: 72: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,164 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,164 INFO L273 TraceCheckUtils]: 74: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 76: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 78: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,165 INFO L273 TraceCheckUtils]: 80: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 82: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 84: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 86: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,166 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 88: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 90: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 92: Hoare triple {23712#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:41,167 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:41,167 INFO L273 TraceCheckUtils]: 97: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 99: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 101: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 103: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 105: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,168 INFO L273 TraceCheckUtils]: 107: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 109: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 111: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 113: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,169 INFO L273 TraceCheckUtils]: 117: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 119: Hoare triple {23712#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:41,170 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,170 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,171 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:41,172 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 144: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23712#true} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,172 INFO L273 TraceCheckUtils]: 146: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 148: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 150: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 152: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 154: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,173 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 156: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 158: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 160: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 162: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 164: Hoare triple {23712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23712#true} is VALID [2018-11-23 12:28:41,174 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:28:41,175 INFO L273 TraceCheckUtils]: 166: Hoare triple {23712#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:28:41,175 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:41,175 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:41,175 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23713#false} is VALID [2018-11-23 12:28:41,175 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:28:41,175 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:41,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:41,189 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:41,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:41,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:41,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:28:41,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:41,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:41,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:41,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:41,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:41,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {23764#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:41,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:41,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:41,656 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:41,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:41,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:41,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:41,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:41,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:41,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:41,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:41,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:41,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:41,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:41,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:41,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:41,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:41,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:41,674 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:41,676 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,676 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:41,677 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,677 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:41,678 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,679 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:41,679 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:41,680 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:41,682 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,682 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:41,683 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,683 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:41,684 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,685 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:41,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:41,686 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:41,687 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:41,687 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:41,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:41,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:41,689 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:41,690 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:28:41,690 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:41,690 INFO L273 TraceCheckUtils]: 70: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:41,690 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 72: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 74: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 76: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 78: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 80: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,692 INFO L273 TraceCheckUtils]: 84: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 86: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 88: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 90: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {23713#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:41,693 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 99: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 101: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 103: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,694 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 105: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 107: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 109: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 111: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 113: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,695 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 115: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 117: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 119: Hoare triple {23713#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 144: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {23713#false} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 146: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 148: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 150: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 152: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 154: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 156: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 158: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 160: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 162: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {23713#false} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 164: Hoare triple {23713#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 166: Hoare triple {23713#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {23713#false} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:41,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:28:41,751 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:41,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:41,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:42,143 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:42,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:42,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:42,145 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:28:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,487 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:28:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:42,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:42,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:28:42,640 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:42,642 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:28:42,642 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:28:42,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:28:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:28:42,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:42,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:42,697 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:42,697 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,698 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,699 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:42,699 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,701 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:42,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:42,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:28:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:28:42,704 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:28:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:42,705 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:28:42,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:28:42,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:42,706 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:42,706 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:42,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:28:42,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:42,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:42,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:42,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:43,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:28:43,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:43,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:43,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:43,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {24970#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,756 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,757 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,757 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,765 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,767 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,768 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,769 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,771 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,772 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,772 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,773 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,773 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,774 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:43,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:28:43,776 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 82: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 84: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 86: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 88: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 94: Hoare triple {24968#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:43,780 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 101: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 103: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 105: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 107: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 109: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 111: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 113: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 115: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 117: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 119: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 121: Hoare triple {24968#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,783 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:43,785 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 146: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 148: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 150: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 152: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 154: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 156: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 158: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 160: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 162: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 164: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 166: Hoare triple {24968#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 168: Hoare triple {24968#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:43,787 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:43,788 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24969#false} is VALID [2018-11-23 12:28:43,788 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:28:43,788 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:43,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:43,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:43,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:43,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:43,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:44,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:44,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:28:44,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:44,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:44,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:44,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:44,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:44,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {25021#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,253 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,257 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,257 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,258 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,258 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,259 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,262 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,265 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,268 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,268 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,269 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,270 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,271 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,272 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,273 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,278 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,279 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,280 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:44,281 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:28:44,281 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:44,281 INFO L273 TraceCheckUtils]: 72: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:44,281 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,282 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,282 INFO L273 TraceCheckUtils]: 76: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,282 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,282 INFO L273 TraceCheckUtils]: 78: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 80: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 82: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,283 INFO L273 TraceCheckUtils]: 84: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 86: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 88: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,284 INFO L273 TraceCheckUtils]: 90: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L273 TraceCheckUtils]: 92: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L273 TraceCheckUtils]: 94: Hoare triple {24969#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:44,285 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 99: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 101: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 103: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,286 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 105: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 107: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 109: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 111: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 113: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,287 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 115: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 117: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 119: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 121: Hoare triple {24969#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:44,288 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,289 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:28:44,290 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 146: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 148: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 150: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 152: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,291 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 154: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 156: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 158: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 160: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 162: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,292 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 164: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 166: Hoare triple {24969#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 168: Hoare triple {24969#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:28:44,293 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:44,307 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:44,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:44,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:28:44,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:44,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:44,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:28:44,436 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:44,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:28:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:28:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:44,437 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:28:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,492 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:28:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:45,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:45,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:28:45,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:45,614 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:28:45,614 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:28:45,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:28:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:28:45,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:45,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,703 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,703 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,705 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,706 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:45,706 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:45,708 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:45,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:45,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:45,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:28:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:28:45,711 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:28:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:45,711 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:28:45,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:28:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:28:45,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:45,712 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:45,713 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:45,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:28:45,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:45,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:45,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:46,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:28:46,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:46,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:46,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {26243#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {26244#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {26245#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {26246#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {26247#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {26248#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {26249#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {26250#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {26251#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {26252#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {26253#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,471 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {26254#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {26255#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,473 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {26256#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,475 INFO L273 TraceCheckUtils]: 35: Hoare triple {26257#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,476 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,476 INFO L273 TraceCheckUtils]: 37: Hoare triple {26258#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,477 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,477 INFO L273 TraceCheckUtils]: 39: Hoare triple {26259#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {26260#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,479 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {26261#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {26262#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,482 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,482 INFO L273 TraceCheckUtils]: 47: Hoare triple {26263#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {26264#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,484 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,485 INFO L273 TraceCheckUtils]: 51: Hoare triple {26265#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,485 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,486 INFO L273 TraceCheckUtils]: 53: Hoare triple {26266#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,487 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,487 INFO L273 TraceCheckUtils]: 55: Hoare triple {26267#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,488 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {26268#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {26269#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,490 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,491 INFO L273 TraceCheckUtils]: 61: Hoare triple {26270#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {26271#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {26272#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,494 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,495 INFO L273 TraceCheckUtils]: 67: Hoare triple {26273#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,495 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,496 INFO L273 TraceCheckUtils]: 69: Hoare triple {26274#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,496 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,497 INFO L273 TraceCheckUtils]: 71: Hoare triple {26275#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26276#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:46,498 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 10000); {26242#false} is VALID [2018-11-23 12:28:46,498 INFO L256 TraceCheckUtils]: 73: Hoare triple {26242#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,498 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,498 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 99: Hoare triple {26242#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:46,502 INFO L256 TraceCheckUtils]: 100: Hoare triple {26242#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,504 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 126: Hoare triple {26242#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {26242#false} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 128: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 130: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 132: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 134: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 136: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 138: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 140: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 142: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 144: Hoare triple {26242#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:46,506 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 148: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 150: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 152: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 154: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 156: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 158: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 160: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 162: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 164: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 166: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 168: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 170: Hoare triple {26241#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:46,509 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26242#false} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:28:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:46,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:46,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:28:46,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:47,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:47,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:28:47,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:47,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:47,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,283 INFO L273 TraceCheckUtils]: 17: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 39: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 45: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 49: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 55: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 59: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 65: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 67: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 69: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 71: Hoare triple {26241#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {26241#true} is VALID [2018-11-23 12:28:47,289 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L256 TraceCheckUtils]: 73: Hoare triple {26241#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,290 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,291 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 99: Hoare triple {26241#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L256 TraceCheckUtils]: 100: Hoare triple {26241#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26241#true} is VALID [2018-11-23 12:28:47,292 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,293 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26241#true} is VALID [2018-11-23 12:28:47,294 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:28:47,295 INFO L273 TraceCheckUtils]: 126: Hoare triple {26241#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:47,296 INFO L273 TraceCheckUtils]: 128: Hoare triple {26658#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 130: Hoare triple {26665#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:47,298 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:47,299 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 134: Hoare triple {26679#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:47,300 INFO L273 TraceCheckUtils]: 136: Hoare triple {26686#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:47,301 INFO L273 TraceCheckUtils]: 138: Hoare triple {26693#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:47,302 INFO L273 TraceCheckUtils]: 140: Hoare triple {26700#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:47,303 INFO L273 TraceCheckUtils]: 142: Hoare triple {26707#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:47,304 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 144: Hoare triple {26714#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {26721#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:28:47,305 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 148: Hoare triple {26242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 150: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,306 INFO L273 TraceCheckUtils]: 152: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 154: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 156: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,307 INFO L273 TraceCheckUtils]: 158: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 160: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 162: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 164: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 166: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,308 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 168: Hoare triple {26242#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 10000); {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 170: Hoare triple {26242#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:28:47,309 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-11-23 12:28:47,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:47,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:28:47,344 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:47,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:47,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:28:47,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:47,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:28:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:28:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:47,470 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:28:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:48,643 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:28:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:28:48,643 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:48,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:28:48,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:48,783 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:28:48,783 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:28:48,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:28:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:28:49,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:49,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,107 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,107 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,109 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:49,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,110 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:49,110 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:49,112 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:49,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:49,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:49,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:49,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:28:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:28:49,114 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:28:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:49,114 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:28:49,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:28:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:28:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:28:49,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:49,115 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:49,115 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:49,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:28:49,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:49,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:50,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:28:50,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:50,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:50,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:50,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:50,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {27555#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:50,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:50,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {27556#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:50,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:50,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {27557#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:50,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:50,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {27558#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:50,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:50,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {27559#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:50,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:50,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {27560#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:50,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:50,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {27561#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:50,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:50,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {27562#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:50,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:50,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {27563#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:50,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:50,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {27564#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:50,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:50,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {27565#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:50,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:50,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {27566#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:50,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:50,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {27567#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:50,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:50,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {27568#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:50,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:50,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {27569#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:50,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:50,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {27570#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:50,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:50,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {27571#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:50,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:50,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {27572#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:50,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:50,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {27573#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:50,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:50,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {27574#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:50,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:50,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {27575#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:50,333 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:50,333 INFO L273 TraceCheckUtils]: 49: Hoare triple {27576#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:50,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:50,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {27577#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:50,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:50,336 INFO L273 TraceCheckUtils]: 53: Hoare triple {27578#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:50,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:50,337 INFO L273 TraceCheckUtils]: 55: Hoare triple {27579#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:50,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:50,338 INFO L273 TraceCheckUtils]: 57: Hoare triple {27580#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:50,338 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:50,339 INFO L273 TraceCheckUtils]: 59: Hoare triple {27581#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:50,340 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:50,340 INFO L273 TraceCheckUtils]: 61: Hoare triple {27582#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:50,341 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:50,341 INFO L273 TraceCheckUtils]: 63: Hoare triple {27583#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:50,342 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:50,343 INFO L273 TraceCheckUtils]: 65: Hoare triple {27584#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:50,343 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:50,344 INFO L273 TraceCheckUtils]: 67: Hoare triple {27585#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:50,344 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:50,345 INFO L273 TraceCheckUtils]: 69: Hoare triple {27586#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:50,345 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:50,346 INFO L273 TraceCheckUtils]: 71: Hoare triple {27587#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:50,346 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:50,347 INFO L273 TraceCheckUtils]: 73: Hoare triple {27588#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27589#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:50,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 10000); {27554#false} is VALID [2018-11-23 12:28:50,348 INFO L256 TraceCheckUtils]: 75: Hoare triple {27554#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,348 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,348 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,350 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,351 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 101: Hoare triple {27554#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:50,352 INFO L256 TraceCheckUtils]: 102: Hoare triple {27554#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,352 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,353 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,354 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 128: Hoare triple {27554#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {27554#false} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,354 INFO L273 TraceCheckUtils]: 130: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 132: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 134: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 136: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 138: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,355 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 140: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 142: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 144: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 146: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 148: Hoare triple {27554#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:28:50,356 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:50,357 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 152: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 154: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 156: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 158: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,357 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 160: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 162: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 164: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 166: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 168: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,358 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 170: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 172: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 174: Hoare triple {27553#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,359 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27554#false} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:28:50,359 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:28:50,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:50,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:50,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:50,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:50,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:50,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:50,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:28:50,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:50,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:50,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,875 INFO L273 TraceCheckUtils]: 17: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 19: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 23: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 25: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 31: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 41: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 51: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 61: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 69: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 71: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {27553#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L256 TraceCheckUtils]: 75: Hoare triple {27553#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,882 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 101: Hoare triple {27553#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L256 TraceCheckUtils]: 102: Hoare triple {27553#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,884 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,885 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:28:50,886 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:50,887 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:28:50,887 INFO L273 TraceCheckUtils]: 128: Hoare triple {27553#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:50,887 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:50,888 INFO L273 TraceCheckUtils]: 130: Hoare triple {27977#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:50,888 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:50,889 INFO L273 TraceCheckUtils]: 132: Hoare triple {27984#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:50,889 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:50,889 INFO L273 TraceCheckUtils]: 134: Hoare triple {27991#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:50,890 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:50,890 INFO L273 TraceCheckUtils]: 136: Hoare triple {27998#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:50,890 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:50,891 INFO L273 TraceCheckUtils]: 138: Hoare triple {28005#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:50,891 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:50,892 INFO L273 TraceCheckUtils]: 140: Hoare triple {28012#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:50,893 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:50,893 INFO L273 TraceCheckUtils]: 142: Hoare triple {28019#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:50,894 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:50,895 INFO L273 TraceCheckUtils]: 144: Hoare triple {28026#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:50,895 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:50,896 INFO L273 TraceCheckUtils]: 146: Hoare triple {28033#(<= main_~i~2 8)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:50,896 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:50,897 INFO L273 TraceCheckUtils]: 148: Hoare triple {28040#(<= main_~i~2 9)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28047#(<= main_~i~2 10)} is VALID [2018-11-23 12:28:50,898 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:28:50,898 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:50,898 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {27554#false} is VALID [2018-11-23 12:28:50,898 INFO L273 TraceCheckUtils]: 152: Hoare triple {27554#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {27554#false} is VALID [2018-11-23 12:28:50,898 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 154: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 156: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 158: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,899 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 160: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 162: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 164: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,900 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 166: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 168: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 170: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 172: Hoare triple {27554#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 10000); {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 174: Hoare triple {27554#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27554#false} is VALID [2018-11-23 12:28:50,901 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:28:50,902 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:50,902 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {27554#false} is VALID [2018-11-23 12:28:50,902 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:28:50,902 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:50,914 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:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:28:50,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:50,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:50,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:28:51,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:51,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:28:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:28:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:51,069 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:28:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:51,589 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:28:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:28:51,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:28:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:28:51,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:28:52,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:52,032 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:28:52,032 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:28:52,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:28:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:28:52,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:52,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,142 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,142 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:28:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,144 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:52,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:52,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:52,144 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:52,144 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:28:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,147 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:28:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:28:52,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:52,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:52,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:52,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:28:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:28:52,150 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:28:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:52,150 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:28:52,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:28:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:28:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:28:52,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:52,151 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:52,152 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:52,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:28:52,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:52,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:28:52,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:28:52,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:52,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:28:52,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:28:52,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {28904#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {28905#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {28906#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {28907#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {28908#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {28909#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {28910#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {28911#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,967 INFO L273 TraceCheckUtils]: 23: Hoare triple {28912#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {28913#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {28914#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {28915#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,971 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {28916#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {28917#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,973 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {28918#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {28919#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,976 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {28920#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {28923#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {28924#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,982 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {28925#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {28926#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,985 INFO L273 TraceCheckUtils]: 53: Hoare triple {28927#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,986 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,986 INFO L273 TraceCheckUtils]: 55: Hoare triple {28928#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,987 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,988 INFO L273 TraceCheckUtils]: 57: Hoare triple {28929#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,989 INFO L273 TraceCheckUtils]: 59: Hoare triple {28930#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,990 INFO L273 TraceCheckUtils]: 61: Hoare triple {28931#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,991 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,991 INFO L273 TraceCheckUtils]: 63: Hoare triple {28932#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,993 INFO L273 TraceCheckUtils]: 65: Hoare triple {28933#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,993 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {28934#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,994 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {28935#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,996 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,996 INFO L273 TraceCheckUtils]: 71: Hoare triple {28936#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {28937#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,998 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,999 INFO L273 TraceCheckUtils]: 75: Hoare triple {28938#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28939#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,999 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 10000); {28903#false} is VALID [2018-11-23 12:28:53,000 INFO L256 TraceCheckUtils]: 77: Hoare triple {28903#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 84: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 86: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 88: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 90: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 92: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 94: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 96: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 98: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 100: Hoare triple {28902#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,003 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:53,004 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 105: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 107: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 109: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 111: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 113: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 115: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 117: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 119: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 121: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 123: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 125: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 127: Hoare triple {28902#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,006 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:53,009 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 156: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 158: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 160: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 162: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 164: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 166: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 168: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 170: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 172: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 174: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 176: Hoare triple {28902#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 178: Hoare triple {28902#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:53,011 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28903#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:28:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-11-23 12:28:53,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:53,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:53,035 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:09,454 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:30:09,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:09,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:10,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:30:10,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:30:10,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:30:10,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:30:10,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:30:10,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 27: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 49: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,299 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 53: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 57: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,300 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 63: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 65: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 67: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 69: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,301 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 71: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 73: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 75: Hoare triple {28902#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 10000); {28902#true} is VALID [2018-11-23 12:30:10,302 INFO L256 TraceCheckUtils]: 77: Hoare triple {28902#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:30:10,303 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {29177#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:10,303 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29177#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:10,303 INFO L273 TraceCheckUtils]: 80: Hoare triple {29177#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29184#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:10,304 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29184#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:10,304 INFO L273 TraceCheckUtils]: 82: Hoare triple {29184#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29191#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:10,304 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29191#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:10,305 INFO L273 TraceCheckUtils]: 84: Hoare triple {29191#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29198#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:10,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29198#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:10,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {29198#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29205#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:10,306 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29205#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:10,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {29205#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29212#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:10,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29212#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:10,308 INFO L273 TraceCheckUtils]: 90: Hoare triple {29212#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29219#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:10,308 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= mapsum_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29219#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:10,309 INFO L273 TraceCheckUtils]: 92: Hoare triple {29219#(<= mapsum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29226#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:10,309 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= mapsum_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29226#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:10,310 INFO L273 TraceCheckUtils]: 94: Hoare triple {29226#(<= mapsum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29233#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:10,311 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= mapsum_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29233#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:10,311 INFO L273 TraceCheckUtils]: 96: Hoare triple {29233#(<= mapsum_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29240#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:10,312 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= mapsum_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29240#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:10,312 INFO L273 TraceCheckUtils]: 98: Hoare triple {29240#(<= mapsum_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29247#(<= mapsum_~i~0 10)} is VALID [2018-11-23 12:30:10,313 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= mapsum_~i~0 10)} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:30:10,313 INFO L273 TraceCheckUtils]: 100: Hoare triple {28903#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L273 TraceCheckUtils]: 105: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28903#false} is VALID [2018-11-23 12:30:10,314 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 107: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 109: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 111: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,315 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,316 INFO L273 TraceCheckUtils]: 113: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,316 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,316 INFO L273 TraceCheckUtils]: 115: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,316 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,316 INFO L273 TraceCheckUtils]: 117: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 119: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 121: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 123: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,317 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L273 TraceCheckUtils]: 125: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L273 TraceCheckUtils]: 127: Hoare triple {28903#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:30:10,318 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,319 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,320 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 156: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 158: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,321 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 160: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 162: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 164: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 166: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 168: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,322 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 170: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 172: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 174: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 176: Hoare triple {28903#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 178: Hoare triple {28903#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:30:10,323 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:10,324 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:30:10,324 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28903#false} is VALID [2018-11-23 12:30:10,324 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:30:10,324 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:30:10,337 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:30:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:10,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:30:10,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:30:10,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:10,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:30:10,499 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:30:10,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:30:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:30:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:30:10,501 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:30:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,321 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:30:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:30:11,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:30:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:30:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:30:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:30:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:30:11,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:30:11,479 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:11,482 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:30:11,482 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:30:11,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:30:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:30:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:30:11,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:11,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:11,547 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:11,547 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,550 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:30:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:30:11,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,550 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:30:11,551 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:30:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,553 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:30:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:30:11,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:11,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:30:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:30:11,557 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:30:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:11,558 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:30:11,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:30:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:30:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:30:11,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:11,559 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:30:11,559 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:11,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:30:11,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:11,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:12,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:30:12,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:30:12,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:12,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:30:12,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:30:12,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:30:12,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:30:12,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {30289#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:12,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:12,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {30290#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:12,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:12,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {30291#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:12,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:12,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {30292#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:12,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:12,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {30293#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:12,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:12,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {30294#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:12,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:12,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {30295#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:12,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:12,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {30296#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:12,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:12,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {30297#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:12,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:12,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {30298#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:12,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:12,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {30299#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:12,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:12,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {30300#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:12,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:12,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {30301#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:12,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:12,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {30302#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:12,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:12,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {30303#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:12,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:12,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {30304#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:12,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:12,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {30305#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:12,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:12,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {30306#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:12,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:12,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {30307#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:12,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:12,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {30308#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:12,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:12,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {30309#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:12,460 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:12,460 INFO L273 TraceCheckUtils]: 49: Hoare triple {30310#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:12,461 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:12,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {30311#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:12,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:12,463 INFO L273 TraceCheckUtils]: 53: Hoare triple {30312#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:12,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:12,464 INFO L273 TraceCheckUtils]: 55: Hoare triple {30313#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:12,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:12,465 INFO L273 TraceCheckUtils]: 57: Hoare triple {30314#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:12,466 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:12,467 INFO L273 TraceCheckUtils]: 59: Hoare triple {30315#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:12,467 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:12,468 INFO L273 TraceCheckUtils]: 61: Hoare triple {30316#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:12,468 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:12,469 INFO L273 TraceCheckUtils]: 63: Hoare triple {30317#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:12,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:12,470 INFO L273 TraceCheckUtils]: 65: Hoare triple {30318#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:12,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:12,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {30319#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:12,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:12,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {30320#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:12,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:12,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {30321#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:12,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:12,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {30322#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:12,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:12,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {30323#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:12,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:12,478 INFO L273 TraceCheckUtils]: 77: Hoare triple {30324#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30325#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:12,478 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 10000); {30288#false} is VALID [2018-11-23 12:30:12,479 INFO L256 TraceCheckUtils]: 79: Hoare triple {30288#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:12,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:12,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,479 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,480 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,481 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,482 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,482 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,482 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,482 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 107: Hoare triple {30288#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:30:12,483 INFO L256 TraceCheckUtils]: 108: Hoare triple {30288#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:12,483 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,484 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,485 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:12,486 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 136: Hoare triple {30288#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {30288#false} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 138: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,486 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 140: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 142: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 144: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 146: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 148: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,487 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 150: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 152: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 154: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 156: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30288#false} is VALID [2018-11-23 12:30:12,488 INFO L273 TraceCheckUtils]: 158: Hoare triple {30288#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30288#false} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 9999); {30288#false} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:30:12,489 INFO L256 TraceCheckUtils]: 161: Hoare triple {30288#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 164: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 166: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,489 INFO L273 TraceCheckUtils]: 168: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 170: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 172: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 174: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 176: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,490 INFO L273 TraceCheckUtils]: 178: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 180: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 182: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 184: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 186: Hoare triple {30287#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:12,491 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:30:12,492 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30288#false} is VALID [2018-11-23 12:30:12,492 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:30:12,492 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:30:12,509 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:30:12,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:12,510 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:30:12,519 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:27,591 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:30:27,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:27,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:28,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:30:28,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 37: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 43: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 47: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,063 INFO L273 TraceCheckUtils]: 49: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 51: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 53: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,064 INFO L273 TraceCheckUtils]: 59: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 67: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,065 INFO L273 TraceCheckUtils]: 69: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 71: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 73: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 75: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {30287#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 10000); {30287#true} is VALID [2018-11-23 12:30:28,066 INFO L256 TraceCheckUtils]: 79: Hoare triple {30287#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,067 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,068 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L273 TraceCheckUtils]: 107: Hoare triple {30287#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:30:28,069 INFO L256 TraceCheckUtils]: 108: Hoare triple {30287#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,070 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,071 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 136: Hoare triple {30287#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,072 INFO L273 TraceCheckUtils]: 138: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 140: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 142: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 144: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 146: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,073 INFO L273 TraceCheckUtils]: 148: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 150: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 152: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 154: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 156: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:28,074 INFO L273 TraceCheckUtils]: 158: Hoare triple {30287#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {30287#true} is VALID [2018-11-23 12:30:28,075 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 9999); {30287#true} is VALID [2018-11-23 12:30:28,075 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:30:28,075 INFO L256 TraceCheckUtils]: 161: Hoare triple {30287#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:30:28,075 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {30815#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:28,075 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= mapsum_~i~0 0)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30815#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:28,076 INFO L273 TraceCheckUtils]: 164: Hoare triple {30815#(<= mapsum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30822#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:28,076 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= mapsum_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30822#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:28,077 INFO L273 TraceCheckUtils]: 166: Hoare triple {30822#(<= mapsum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30829#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:28,077 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= mapsum_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30829#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:28,077 INFO L273 TraceCheckUtils]: 168: Hoare triple {30829#(<= mapsum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30836#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:28,078 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= mapsum_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30836#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:28,078 INFO L273 TraceCheckUtils]: 170: Hoare triple {30836#(<= mapsum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30843#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:28,079 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= mapsum_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30843#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:28,079 INFO L273 TraceCheckUtils]: 172: Hoare triple {30843#(<= mapsum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30850#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:28,080 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= mapsum_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30850#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:28,080 INFO L273 TraceCheckUtils]: 174: Hoare triple {30850#(<= mapsum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30857#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:28,082 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= mapsum_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30857#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:28,082 INFO L273 TraceCheckUtils]: 176: Hoare triple {30857#(<= mapsum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30864#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:28,083 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= mapsum_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30864#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:28,083 INFO L273 TraceCheckUtils]: 178: Hoare triple {30864#(<= mapsum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30871#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:28,084 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= mapsum_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30871#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:28,085 INFO L273 TraceCheckUtils]: 180: Hoare triple {30871#(<= mapsum_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30878#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:28,085 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= mapsum_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30878#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:28,086 INFO L273 TraceCheckUtils]: 182: Hoare triple {30878#(<= mapsum_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30885#(<= mapsum_~i~0 10)} is VALID [2018-11-23 12:30:28,086 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= mapsum_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30885#(<= mapsum_~i~0 10)} is VALID [2018-11-23 12:30:28,087 INFO L273 TraceCheckUtils]: 184: Hoare triple {30885#(<= mapsum_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30892#(<= mapsum_~i~0 11)} is VALID [2018-11-23 12:30:28,088 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= mapsum_~i~0 11)} assume !(~i~0 < 10000); {30288#false} is VALID [2018-11-23 12:30:28,088 INFO L273 TraceCheckUtils]: 186: Hoare triple {30288#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {30288#false} is VALID [2018-11-23 12:30:28,088 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:30:28,088 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:30:28,088 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {30288#false} is VALID [2018-11-23 12:30:28,088 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:30:28,089 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:30:28,103 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:28,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:28,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:30:28,127 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:28,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:28,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:30:28,262 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:28,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:30:28,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:30:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:28,264 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:30:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:29,883 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:30:29,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:30:29,884 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:29,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:30:30,050 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:30,053 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:30:30,053 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:30:30,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:30:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:30:30,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:30,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:30,115 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:30,115 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:30,117 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:30,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:30,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:30,118 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:30,118 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:30,120 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:30,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:30,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:30,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:30,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:30:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:30:30,122 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:30:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:30,122 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:30:30,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:30:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:30:30,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:30,124 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:30,124 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:30,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:30:30,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:30,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:30,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:30,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:31,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:30:31,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:30:31,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:31,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:30:31,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret12 := main(); {31721#true} is VALID [2018-11-23 12:30:31,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:30:31,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:30:31,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {31723#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:31,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:31,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:31,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:31,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:31,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:31,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:31,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:31,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:31,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:31,101 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:31,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:31,102 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:31,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:31,104 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:31,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:31,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:31,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:31,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:31,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:31,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:31,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:31,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:31,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:31,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:31,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:31,111 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:31,111 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:31,112 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:31,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:31,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:31,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:31,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:31,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:31,116 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:31,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:31,117 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:31,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:31,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:31,119 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:31,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:31,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:31,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:31,121 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:31,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:31,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:31,123 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:31,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:31,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:31,125 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:31,126 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:31,126 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:31,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:31,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:31,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:31,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:31,130 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:31,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:31,131 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:31,131 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:31,132 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:31,133 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:31,133 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:31,134 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:31,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:31,135 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:31,136 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:31,136 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:31,137 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:31,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:31,138 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:31,139 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:31,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:31,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 10000); {31722#false} is VALID [2018-11-23 12:30:31,141 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:30:31,141 INFO L273 TraceCheckUtils]: 82: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31721#true} is VALID [2018-11-23 12:30:31,141 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,141 INFO L273 TraceCheckUtils]: 84: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,141 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 88: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 90: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,142 INFO L273 TraceCheckUtils]: 92: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,143 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,143 INFO L273 TraceCheckUtils]: 94: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,143 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,143 INFO L273 TraceCheckUtils]: 96: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,143 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 98: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 100: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 102: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,144 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 104: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 106: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 108: Hoare triple {31721#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:31,145 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#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); {31722#false} is VALID [2018-11-23 12:30:31,146 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 113: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 115: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 117: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 119: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,146 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 121: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 123: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 125: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 127: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 129: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,147 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 131: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 133: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 135: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 137: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 139: Hoare triple {31721#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:30:31,148 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:31,149 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#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; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,149 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,150 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 9999); {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:30:31,151 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 168: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31721#true} is VALID [2018-11-23 12:30:31,151 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 170: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 172: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 174: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 176: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 178: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,152 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 180: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 182: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 184: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 186: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,153 INFO L273 TraceCheckUtils]: 188: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 190: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 192: Hoare triple {31721#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 194: Hoare triple {31721#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:31,154 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {31722#false} is VALID [2018-11-23 12:30:31,154 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:30:31,155 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:30:31,172 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:31,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:31,172 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:31,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:31,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:31,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:30:31,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:30:31,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:31,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:30:31,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret12 := main(); {31721#true} is VALID [2018-11-23 12:30:31,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:31,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= main_~i~1 0)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:31,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {31779#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:31,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:31,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:31,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:31,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:31,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:31,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:31,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:31,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:31,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:31,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:31,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:31,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:31,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:31,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:31,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:31,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:31,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:31,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:31,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:31,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:31,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:31,599 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:31,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:31,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:31,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:31,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:31,602 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:31,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:31,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:31,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:31,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:31,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:31,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:31,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:31,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:31,607 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:31,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:31,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:31,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:31,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:31,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:31,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:31,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:31,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:31,613 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:31,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:31,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:31,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:31,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:31,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:31,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:31,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:31,618 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:31,619 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:31,619 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:31,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:31,620 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:31,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:31,622 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:31,622 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:31,623 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:31,624 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:31,624 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:31,625 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:31,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:31,626 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:31,627 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:31,627 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:31,628 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:31,629 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:31,629 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:31,630 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:31,631 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 10000); {31722#false} is VALID [2018-11-23 12:30:31,631 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:30:31,631 INFO L273 TraceCheckUtils]: 82: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31722#false} is VALID [2018-11-23 12:30:31,631 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,631 INFO L273 TraceCheckUtils]: 84: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,631 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,632 INFO L273 TraceCheckUtils]: 86: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,632 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,632 INFO L273 TraceCheckUtils]: 88: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,632 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,632 INFO L273 TraceCheckUtils]: 90: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 92: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 94: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,633 INFO L273 TraceCheckUtils]: 96: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 98: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 100: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,634 INFO L273 TraceCheckUtils]: 102: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,635 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,635 INFO L273 TraceCheckUtils]: 104: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,635 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,635 INFO L273 TraceCheckUtils]: 106: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,635 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 108: Hoare triple {31722#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#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); {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,636 INFO L273 TraceCheckUtils]: 115: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 117: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 119: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 121: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 123: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,637 INFO L273 TraceCheckUtils]: 125: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 127: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 129: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 131: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 133: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,638 INFO L273 TraceCheckUtils]: 135: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 137: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 139: Hoare triple {31722#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#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; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,639 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,640 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {31722#false} is VALID [2018-11-23 12:30:31,641 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 9999); {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 168: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 170: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 172: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,642 INFO L273 TraceCheckUtils]: 174: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 176: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 178: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 180: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 182: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,643 INFO L273 TraceCheckUtils]: 184: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 186: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 188: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 190: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 192: Hoare triple {31722#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:30:31,644 INFO L273 TraceCheckUtils]: 194: Hoare triple {31722#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:30:31,645 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:31,645 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:30:31,645 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {31722#false} is VALID [2018-11-23 12:30:31,645 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:30:31,645 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:30:31,663 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:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:30:31,683 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:31,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:31,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:30:31,806 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:31,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:30:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:30:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:31,808 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:30:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:32,610 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:30:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:30:32,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:32,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:30:32,746 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:32,749 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:30:32,749 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:30:32,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.