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/mapsum2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:27:14,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:27:14,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:27:14,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:27:14,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:27:14,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:27:14,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:27:14,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:27:14,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:27:14,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:27:14,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:27:14,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:27:14,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:27:14,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:27:14,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:27:14,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:27:14,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:27:14,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:27:14,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:27:14,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:27:14,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:27:14,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:27:14,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:27:14,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:27:14,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:27:14,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:27:14,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:27:14,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:27:14,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:27:14,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:27:14,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:27:14,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:27:14,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:27:14,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:27:14,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:27:14,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:27:14,417 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:14,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:27:14,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:27:14,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:27:14,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:27:14,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:27:14,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:27:14,450 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:27:14,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:27:14,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:27:14,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:27:14,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:27:14,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:27:14,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:27:14,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:27:14,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:27:14,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:27:14,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:27:14,453 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:27:14,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:27:14,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:27:14,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:27:14,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:27:14,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:27:14,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:27:14,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:27:14,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:27:14,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:27:14,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:27:14,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:27:14,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:27:14,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:27:14,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:27:14,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:27:14,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:27:14,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:27:14,529 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:27:14,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum2_true-unreach-call.i [2018-11-23 12:27:14,595 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5df2c0d/36da6260192640f387912f6479a946b4/FLAGbfe44f1d8 [2018-11-23 12:27:15,097 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:27:15,098 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum2_true-unreach-call.i [2018-11-23 12:27:15,105 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5df2c0d/36da6260192640f387912f6479a946b4/FLAGbfe44f1d8 [2018-11-23 12:27:15,456 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5df2c0d/36da6260192640f387912f6479a946b4 [2018-11-23 12:27:15,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:27:15,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:27:15,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:15,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:27:15,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:27:15,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:15" (1/1) ... [2018-11-23 12:27:15,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e75a9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:15, skipping insertion in model container [2018-11-23 12:27:15,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:27:15" (1/1) ... [2018-11-23 12:27:15,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:27:15,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:27:15,809 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:15,828 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:27:15,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:27:15,891 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:27:15,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:15 WrapperNode [2018-11-23 12:27:15,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:27:15,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:15,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:27:15,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:27:15,905 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:15" (1/1) ... [2018-11-23 12:27:15,917 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:15" (1/1) ... [2018-11-23 12:27:15,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:27:15,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:27:15,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:27:15,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:27:15,941 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:15" (1/1) ... [2018-11-23 12:27:15,941 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:15" (1/1) ... [2018-11-23 12:27:15,949 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:15" (1/1) ... [2018-11-23 12:27:15,949 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:15" (1/1) ... [2018-11-23 12:27:15,980 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:15" (1/1) ... [2018-11-23 12:27:15,989 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:15" (1/1) ... [2018-11-23 12:27:15,996 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:15" (1/1) ... [2018-11-23 12:27:16,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:27:16,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:27:16,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:27:16,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:27:16,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:15" (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:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:27:16,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:27:16,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:27:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:27:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2018-11-23 12:27:16,182 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2018-11-23 12:27:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:27:16,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:27:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:27:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:27:16,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:27:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:27:16,912 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:27:16,913 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:27:16,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:16 BoogieIcfgContainer [2018-11-23 12:27:16,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:27:16,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:27:16,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:27:16,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:27:16,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:27:15" (1/3) ... [2018-11-23 12:27:16,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3fc7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:16, skipping insertion in model container [2018-11-23 12:27:16,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:27:15" (2/3) ... [2018-11-23 12:27:16,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3fc7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:27:16, skipping insertion in model container [2018-11-23 12:27:16,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:27:16" (3/3) ... [2018-11-23 12:27:16,923 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum2_true-unreach-call.i [2018-11-23 12:27:16,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:27:16,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:27:16,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:27:16,997 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:27:16,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:27:16,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:27:16,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:27:16,999 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:27:16,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:27:16,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:27:16,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:27:17,000 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:27:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:27:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:17,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:17,028 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:17,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:17,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:27:17,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:17,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:17,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:17,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:27:17,286 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:17,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:17,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:27:17,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:27:17,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:27:17,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:27:17,299 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:17,300 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:17,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:27:17,300 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:17,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:17,301 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:27:17,301 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:17,302 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:17,302 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:17,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:27:17,303 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:17,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:17,304 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:27:17,304 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:17,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:27:17,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:27:17,305 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:17,306 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:17,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 1000); {34#true} is VALID [2018-11-23 12:27:17,306 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:17,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:27:17,307 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:27:17,307 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:17,308 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:17,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:27:17,314 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:17,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:17,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:27:17,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:17,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:17,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:27:17,538 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:17,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:27:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:27:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:27:17,552 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:27:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:17,674 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:27:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:27:17,674 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:27:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:27:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:27:17,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:27:17,976 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:17,988 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:17,988 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:27:17,992 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:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:27:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:27:18,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:18,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:18,041 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:18,042 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,048 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:18,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,050 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:18,050 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:27:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,055 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:27:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:18,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:18,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:18,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:18,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:27:18,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:27:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:18,063 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:27:18,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:27:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:27:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:27:18,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:18,066 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:18,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:27:18,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:18,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:27:18,173 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:18,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:18,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:27:18,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:27:18,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:27:18,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 1000); {199#false} is VALID [2018-11-23 12:27:18,194 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:18,195 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:18,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:27:18,195 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:18,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:18,196 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:27:18,196 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:18,196 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:18,196 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:18,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:27:18,197 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:18,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:18,198 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:27:18,198 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:18,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 999); {199#false} is VALID [2018-11-23 12:27:18,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:27:18,199 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:18,199 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:18,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 1000); {198#true} is VALID [2018-11-23 12:27:18,200 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:18,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:27:18,201 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:27:18,201 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:18,202 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:18,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:27:18,205 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:18,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:18,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:18,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:18,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:18,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:18,282 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:18,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:18,284 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:27:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:18,883 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:27:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:18,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:27:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:27:18,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:27:19,023 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:19,025 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:19,025 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:27:19,026 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:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:27:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:27:19,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:19,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:19,052 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:19,053 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:27:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,057 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:19,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,058 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:19,059 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:27:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,062 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:27:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:19,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:19,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:19,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:19,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:27:19,067 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:27:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:19,067 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:27:19,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:27:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:27:19,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:19,069 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:19,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:19,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:27:19,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:19,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:19,206 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:19,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:19,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:19,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:19,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:19,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:27:19,208 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:19,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:27:19,208 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:19,209 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:19,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= mapsum_~i~0 0)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:27:19,211 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:19,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:19,212 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:19,212 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:19,212 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:19,212 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:19,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:27:19,213 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:19,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:19,214 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:19,214 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:19,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:27:19,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:19,215 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:19,215 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:19,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 1000); {362#true} is VALID [2018-11-23 12:27:19,216 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:19,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:19,217 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:19,217 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:19,217 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:19,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:19,220 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:19,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:19,221 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:19,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:19,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:19,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:27:19,469 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:19,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:27:19,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:27:19,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:27:19,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:27:19,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:27:19,471 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:19,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 1000); {362#true} is VALID [2018-11-23 12:27:19,472 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:19,476 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:19,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= mapsum_~i~0 0)} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:27:19,477 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:19,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:19,478 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:27:19,478 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:19,478 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:19,479 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:19,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:27:19,479 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:19,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:19,480 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:27:19,480 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:19,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 999); {363#false} is VALID [2018-11-23 12:27:19,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:27:19,481 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:19,481 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:19,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 1000); {363#false} is VALID [2018-11-23 12:27:19,482 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:19,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:27:19,483 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:27:19,483 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:19,483 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:19,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:27:19,486 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:19,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:27:19,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:27:19,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:19,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:19,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:27:19,630 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:19,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:27:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:27:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:19,631 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:27:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:19,923 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:27:19,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:19,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:27:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:27:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:27:19,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:27:20,051 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:20,054 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:27:20,054 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:27:20,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:27:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:27:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:27:20,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:20,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:20,070 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:20,070 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:27:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,074 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:20,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,075 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:20,075 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:27:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,078 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:27:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:20,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:20,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:27:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:27:20,082 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:27:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:20,084 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:27:20,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:27:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:27:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:27:20,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:20,086 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:20,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:20,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:27:20,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:20,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:27:20,221 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:20,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:20,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:27:20,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:27:20,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:27:20,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {630#true} is VALID [2018-11-23 12:27:20,223 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:20,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 1000); {630#true} is VALID [2018-11-23 12:27:20,223 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:20,224 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:20,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:20,224 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:20,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:27:20,225 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:20,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:20,226 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:27:20,226 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:20,227 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:20,227 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:20,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:20,228 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:20,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:27:20,228 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:20,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:20,229 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:27:20,234 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:20,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 999); {631#false} is VALID [2018-11-23 12:27:20,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:27:20,236 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:20,237 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:20,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:27:20,237 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:20,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 1000); {630#true} is VALID [2018-11-23 12:27:20,237 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:20,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:27:20,238 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:27:20,238 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:20,238 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:20,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:27:20,241 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:20,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:27:20,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:27:20,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:20,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:20,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:27:20,343 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:20,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:27:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:27:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:27:20,344 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:27:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,434 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:27:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:27:20,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:27:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:27:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:27:20,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:27:20,534 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:20,536 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:27:20,537 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:27:20,537 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:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:27:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:27:20,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:20,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:20,552 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:20,552 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:27:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,555 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:20,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,557 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:20,557 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:27:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:20,559 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:27:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:27:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:20,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:20,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:20,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:27:20,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:27:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:20,564 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:27:20,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:27:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:27:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:27:20,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:20,566 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:20,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:20,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:27:20,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:20,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:20,711 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:20,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:20,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:20,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:20,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:20,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:27:20,715 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:20,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:27:20,716 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:20,716 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:20,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:20,717 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:20,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:27:20,717 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:20,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:20,718 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:20,719 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:20,719 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:20,719 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:20,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:20,720 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:20,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:27:20,720 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:20,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:20,721 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:20,721 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:20,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:27:20,722 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:20,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:27:20,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:20,723 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:20,723 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:20,723 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:27:20,724 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:20,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 1000); {799#true} is VALID [2018-11-23 12:27:20,724 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:20,724 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:20,724 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:20,725 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:20,725 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:20,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:20,728 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:20,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:20,729 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:20,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:21,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:27:21,126 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:21,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:27:21,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:27:21,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:27:21,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:21,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:21,129 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:21,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 1000); {800#false} is VALID [2018-11-23 12:27:21,130 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:21,130 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:21,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:21,131 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:21,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:27:21,132 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:21,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:21,133 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:27:21,133 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:21,133 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:21,134 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:21,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:21,134 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:21,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:27:21,135 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:21,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:21,135 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:27:21,135 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:21,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:27:21,136 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:21,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 999); {800#false} is VALID [2018-11-23 12:27:21,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:27:21,136 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:21,136 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:21,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:27:21,137 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:21,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 1000); {800#false} is VALID [2018-11-23 12:27:21,137 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:21,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:27:21,138 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:27:21,138 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:21,139 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:21,139 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:27:21,141 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:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:27:21,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:21,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:21,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:27:21,230 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:21,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:27:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:27:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:27:21,232 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:27:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,418 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:27:21,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:27:21,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:27:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:27:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:27:21,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:27:21,518 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:21,520 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:27:21,520 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:27:21,521 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:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:27:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:27:21,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:21,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:21,605 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:21,605 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:27:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,607 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,608 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:21,608 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:27:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:21,611 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:27:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:27:21,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:21,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:21,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:21,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:27:21,614 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:27:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:21,615 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:27:21,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:27:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:27:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:27:21,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:21,616 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:21,617 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:21,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:27:21,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:21,734 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:21,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:21,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:21,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:21,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:21,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:27:21,743 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:21,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:21,745 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:21,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:27:21,745 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:21,746 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:21,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:21,746 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:21,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:27:21,747 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:21,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:21,748 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:21,748 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:21,748 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:21,749 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:21,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:21,749 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:21,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:27:21,749 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:21,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:21,750 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:21,750 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:21,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:27:21,750 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:21,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:27:21,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:21,751 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:21,751 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:21,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:27:21,752 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:21,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 1000); {1114#true} is VALID [2018-11-23 12:27:21,752 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:21,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:21,752 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:21,753 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:21,753 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:21,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:21,755 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:21,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:21,756 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:21,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:21,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:21,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:21,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:21,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:27:21,954 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:21,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:27:21,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:27:21,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:27:21,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:21,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:21,969 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:21,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:21,971 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:21,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1115#false} is VALID [2018-11-23 12:27:21,979 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:21,979 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:21,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:21,980 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:21,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:27:21,980 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:21,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:21,981 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:27:21,981 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:21,981 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:21,981 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:21,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:21,982 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:21,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:27:21,982 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:21,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:21,983 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:27:21,983 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:21,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:27:21,983 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:21,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 999); {1115#false} is VALID [2018-11-23 12:27:21,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:27:21,984 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:21,984 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:21,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:27:21,984 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:21,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 1000); {1115#false} is VALID [2018-11-23 12:27:21,985 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:21,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:27:21,985 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:27:21,986 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:21,986 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:21,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:27:21,988 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:22,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:22,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:27:22,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:22,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:22,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:27:22,063 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:22,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:27:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:27:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:27:22,064 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:27:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,243 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:27:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:27:22,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:27:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:27:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:27:22,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:27:22,373 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:22,376 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:27:22,376 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:27:22,376 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:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:27:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:27:22,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:22,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:22,394 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:22,394 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:27:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,397 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:22,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,398 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:22,398 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:27:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,400 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:27:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:27:22,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:22,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:27:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:27:22,404 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:27:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:22,404 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:27:22,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:27:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:27:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:27:22,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:22,406 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:22,406 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:22,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:27:22,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:22,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:22,672 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:22,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:22,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:22,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:22,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:22,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:27:22,681 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:22,683 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:22,683 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:22,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:22,685 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:22,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 1000); {1447#false} is VALID [2018-11-23 12:27:22,687 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:22,688 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:22,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:22,689 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:22,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:27:22,689 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:22,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:22,690 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:27:22,690 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:22,690 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:22,690 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:22,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:22,691 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:22,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:27:22,691 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:22,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:22,692 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:27:22,692 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:22,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1447#false} is VALID [2018-11-23 12:27:22,693 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:22,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 999); {1447#false} is VALID [2018-11-23 12:27:22,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:27:22,694 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:22,694 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:22,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:22,694 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:22,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:27:22,695 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:22,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:22,695 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:27:22,696 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:22,696 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:22,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:22,699 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:22,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:22,700 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:22,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:22,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:27:22,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:22,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:23,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:27:23,360 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:23,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:23,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:27:23,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:27:23,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:27:23,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:23,361 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:23,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:23,362 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:23,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:27:23,362 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:23,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 1000); {1446#true} is VALID [2018-11-23 12:27:23,362 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:23,363 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:23,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:23,363 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:23,363 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:27:23,363 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:23,364 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:23,364 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:27:23,364 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:23,364 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:23,364 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:23,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:27:23,365 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:23,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 1000); {1446#true} is VALID [2018-11-23 12:27:23,365 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:23,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:27:23,365 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:27:23,365 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:23,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1446#true} is VALID [2018-11-23 12:27:23,366 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:23,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 999); {1446#true} is VALID [2018-11-23 12:27:23,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:27:23,366 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:23,367 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:23,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1563#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:23,373 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:23,374 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= mapsum_~i~0 1)} assume !(~i~0 < 1000); {1447#false} is VALID [2018-11-23 12:27:23,374 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:23,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:27:23,375 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:27:23,375 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:23,375 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:23,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:27:23,377 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:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:27:23,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:23,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:23,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:23,537 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,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:23,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:23,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:23,539 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:27:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:23,891 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:27:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:27:23,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:27:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:27:23,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:27:23,996 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:23,998 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:27:23,998 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:27:23,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:27:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:27:24,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:24,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:24,125 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:24,125 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:27:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,129 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:24,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,130 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:24,130 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:27:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:24,133 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:27:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:24,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:24,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:24,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:24,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:27:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:27:24,136 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:27:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:24,137 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:27:24,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:27:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:27:24,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:24,138 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:24,138 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:27:24,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:24,645 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:24,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:24,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:24,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:24,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:27:24,647 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:24,648 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,648 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:24,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:24,649 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:24,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:24,650 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:24,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:27:24,652 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:24,652 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:24,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,652 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:24,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,653 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:24,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:27:24,653 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:24,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:24,654 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:24,654 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:24,654 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:24,654 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:24,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,655 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:24,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,655 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:24,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:27:24,656 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:24,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:24,656 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:24,656 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:24,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:27:24,656 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:24,657 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:27:24,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:24,657 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:24,657 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:24,657 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,657 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:24,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:27:24,658 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:24,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 1000); {1809#true} is VALID [2018-11-23 12:27:24,658 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:24,658 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:24,659 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:24,659 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:24,659 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:24,659 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:24,662 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:24,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:24,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:24,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:24,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:24,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:24,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:27:24,874 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:24,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:27:24,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:27:24,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:27:24,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:24,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:24,876 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:24,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:24,877 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:24,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:24,879 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:24,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:24,880 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:24,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 1000); {1810#false} is VALID [2018-11-23 12:27:24,881 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:24,882 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:24,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,882 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:24,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,883 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:24,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:27:24,884 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:24,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:24,884 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:27:24,885 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:24,885 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:24,885 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:24,885 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,886 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:24,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,886 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:24,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:27:24,886 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:24,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:24,887 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:27:24,887 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:24,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:27:24,888 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:24,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 999); {1810#false} is VALID [2018-11-23 12:27:24,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:27:24,889 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:24,889 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:24,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,889 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:24,890 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:27:24,890 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:24,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 1000); {1810#false} is VALID [2018-11-23 12:27:24,890 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:24,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:27:24,891 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:27:24,891 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:24,891 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:24,891 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:27:24,895 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:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:24,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:27:24,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:24,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:24,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:27:24,975 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:24,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:27:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:27:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:24,977 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:27:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,250 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:27:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:27:25,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:27:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:27:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:27:25,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:27:25,366 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:25,368 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:27:25,369 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:27:25,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:27:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:27:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:27:25,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:25,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:25,418 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:25,419 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:27:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,422 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:25,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,423 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:25,423 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:27:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:25,425 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:27:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:27:25,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:25,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:25,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:25,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:27:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:27:25,428 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:27:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:25,428 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:27:25,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:27:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:27:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:27:25,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:25,429 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:25,429 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:25,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:27:25,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:25,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:27:25,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:25,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:25,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:25,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:25,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:27:25,618 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:25,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:25,619 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:25,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:25,620 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:25,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:25,621 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:25,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:25,622 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:25,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 1000); {2207#false} is VALID [2018-11-23 12:27:25,623 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:25,623 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:25,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,624 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:25,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,624 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:25,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:27:25,625 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:25,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:25,625 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:27:25,625 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:25,626 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:25,626 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:25,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,626 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:25,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,627 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:25,627 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:27:25,627 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:25,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:25,627 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:25,628 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:25,628 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:27:25,628 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:25,628 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:27:25,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:25,628 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:25,628 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:25,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,629 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:25,629 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2206#true} is VALID [2018-11-23 12:27:25,629 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:25,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 1000); {2206#true} is VALID [2018-11-23 12:27:25,629 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:25,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:25,629 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:25,630 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:25,630 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:25,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:25,631 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:25,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:25,632 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:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:25,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:27:25,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:25,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:27:25,937 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:25,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:27:25,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:27:25,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret12 := main(); {2206#true} is VALID [2018-11-23 12:27:25,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:27:25,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:25,938 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:25,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:25,938 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:25,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:25,939 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:25,939 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:25,939 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:25,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2206#true} is VALID [2018-11-23 12:27:25,939 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:25,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 1000); {2206#true} is VALID [2018-11-23 12:27:25,939 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:25,957 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:25,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2271#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:25,979 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:25,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2278#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:26,000 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:26,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= mapsum_~i~0 2)} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:27:26,014 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:26,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:26,015 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:27:26,015 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:26,015 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:26,015 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:26,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:26,015 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:26,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:26,016 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:26,016 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:27:26,016 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:26,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:26,017 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:27:26,017 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:26,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2207#false} is VALID [2018-11-23 12:27:26,017 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:26,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 999); {2207#false} is VALID [2018-11-23 12:27:26,018 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:27:26,018 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:26,018 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:26,018 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:26,018 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:26,019 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2207#false} is VALID [2018-11-23 12:27:26,019 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:26,019 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 1000); {2207#false} is VALID [2018-11-23 12:27:26,019 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:26,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:27:26,020 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:27:26,022 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:26,022 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:26,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:27:26,025 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:26,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:26,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:27:26,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:26,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:26,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:26,264 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:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:26,265 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:27:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:26,870 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:27:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:26,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:27:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:27:26,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:27:27,000 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:27,002 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:27:27,002 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:27:27,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:27:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:27:27,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:27,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:27,018 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:27,018 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:27:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,021 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:27,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,021 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:27,022 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:27:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,024 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:27:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:27:27,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:27,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:27:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:27:27,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:27:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:27,027 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:27:27,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:27:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:27:27,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:27,028 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:27,029 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:27,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:27:27,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:27,228 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:27,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:27,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:27,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:27:27,230 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:27,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:27,231 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:27,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:27,237 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:27,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:27,238 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:27,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:27,239 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:27,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:27,239 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:27,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 1000); {2636#false} is VALID [2018-11-23 12:27:27,240 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:27,241 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:27,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,241 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:27,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,241 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:27,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,242 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:27,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,242 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:27,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,243 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:27:27,243 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:27,243 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:27,243 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:27,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,244 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:27,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,244 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:27,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,244 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:27,245 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,245 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:27,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,245 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:27:27,245 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:27,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2636#false} is VALID [2018-11-23 12:27:27,246 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:27,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:27:27,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:27,246 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:27,246 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:27,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,246 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:27,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,247 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:27,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,247 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:27,247 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,247 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:27,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,247 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:27,248 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:27,248 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:27,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:27,250 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:27,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:27,250 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:27,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:27,350 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:27:27,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:27,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:27,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:27:27,580 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:27,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,581 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:27:27,581 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret12 := main(); {2635#true} is VALID [2018-11-23 12:27:27,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:27:27,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,582 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:27,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,582 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:27,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,583 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:27,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,583 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:27,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,583 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:27,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2635#true} is VALID [2018-11-23 12:27:27,583 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:27,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,584 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:27,584 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:27,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,584 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:27,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,585 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:27,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,585 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:27,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,585 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:27,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,586 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:27:27,586 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:27,586 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:27,586 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:27,587 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,587 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:27,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,587 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:27,587 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2635#true} is VALID [2018-11-23 12:27:27,587 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:27,588 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 1000); {2635#true} is VALID [2018-11-23 12:27:27,588 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:27,588 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:27:27,588 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:27:27,591 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:27,591 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:27,592 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:27,592 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 999); {2636#false} is VALID [2018-11-23 12:27:27,592 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:27:27,593 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:27,593 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:27,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:27,593 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:27,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:27,593 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:27,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {2636#false} is VALID [2018-11-23 12:27:27,594 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:27,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 1000); {2636#false} is VALID [2018-11-23 12:27:27,594 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:27,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:27:27,594 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:27:27,595 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:27,595 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:27,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:27:27,597 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:27,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:27,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:27:27,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:27,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:27,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:27,778 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:27,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:27,779 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:27:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,148 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:27:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:28,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:27:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:27:28,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:27:28,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:28,278 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:27:28,278 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:27:28,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:27:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:27:28,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:28,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:28,325 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:28,325 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:27:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,329 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:28,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,330 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:28,330 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:27:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:28,332 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:27:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:28,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:28,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:28,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:28,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:27:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:27:28,335 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:27:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:28,335 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:27:28,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:27:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:27:28,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:28,336 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:28,336 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:27:28,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:28,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:28,632 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:28,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:28,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:28,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:28,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,634 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:28,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,635 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:28,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,636 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:28,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,637 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:28,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,638 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:28,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,639 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:28,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,641 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:28,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:27:28,642 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:28,642 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:28,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,642 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:28,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,643 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:28,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,643 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:28,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:27:28,644 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:28,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:28,644 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:28,645 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:28,645 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:28,645 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:28,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,646 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:28,646 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,646 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:28,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,647 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:28,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:27:28,647 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:28,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:28,647 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:28,647 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:28,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:28,648 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:28,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:28,648 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:28,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:27:28,648 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:28,649 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:28,649 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:28,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,649 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:28,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,649 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:28,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3111#true} is VALID [2018-11-23 12:27:28,650 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:28,650 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 1000); {3111#true} is VALID [2018-11-23 12:27:28,650 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:28,650 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:28,651 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:28,651 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:28,651 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:28,651 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:28,654 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:28,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:28,654 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:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:28,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:27:28,884 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:28,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:27:28,884 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:27:28,884 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret12 := main(); {3111#true} is VALID [2018-11-23 12:27:28,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:28,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:28,886 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:28,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,887 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:28,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,888 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:28,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,889 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:28,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,890 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:28,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,891 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:28,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,893 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:28,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3112#false} is VALID [2018-11-23 12:27:28,894 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:28,894 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:28,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,894 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:28,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,895 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:28,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,895 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:28,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:28,895 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:28,895 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:28,896 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:27:28,896 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:28,896 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:28,896 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:28,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,897 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:28,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,897 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:28,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,897 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:28,897 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:28,897 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:28,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:28,898 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:27:28,898 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:28,898 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:28,898 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:28,898 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3112#false} is VALID [2018-11-23 12:27:28,898 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:28,898 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 999); {3112#false} is VALID [2018-11-23 12:27:28,898 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:27:28,899 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:28,899 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:28,899 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,899 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:28,899 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,899 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:28,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3112#false} is VALID [2018-11-23 12:27:28,899 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:28,900 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 1000); {3112#false} is VALID [2018-11-23 12:27:28,900 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:28,900 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:27:28,900 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:27:28,900 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:28,900 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:28,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:27:28,902 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:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:28,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:27:28,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:28,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:28,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:27:28,986 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:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:27:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:27:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:27:28,987 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:27:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,243 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:27:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:27:29,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:27:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:27:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:27:29,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:27:29,313 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:29,315 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:27:29,315 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:27:29,315 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:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:27:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:27:29,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:29,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:29,349 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:29,350 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:27:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,352 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:29,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,352 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:29,352 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:27:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,354 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:27:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:27:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:29,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:27:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:27:29,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:27:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:29,356 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:27:29,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:27:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:27:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:27:29,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:29,358 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:29,358 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:29,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:27:29,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:30,327 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:30,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:30,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:30,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:30,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,330 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:30,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,332 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:30,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,333 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:30,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,335 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:30,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,336 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:30,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,338 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:30,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,339 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:30,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,341 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:30,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:27:30,342 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:30,342 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:30,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,343 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:30,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,343 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:30,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,344 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:30,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:30,344 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:30,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:30,345 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:30,345 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:30,345 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:30,346 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:30,346 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,346 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:30,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,346 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:30,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,347 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:30,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:30,347 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:30,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:30,347 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:30,347 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:30,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:30,348 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:30,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:30,348 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:30,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:27:30,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:30,349 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:30,349 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:30,349 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,349 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:30,349 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,349 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:30,349 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3609#true} is VALID [2018-11-23 12:27:30,350 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:30,350 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 1000); {3609#true} is VALID [2018-11-23 12:27:30,350 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:30,350 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:30,350 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:30,350 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:30,350 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:30,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:30,353 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:30,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:30,353 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:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:30,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:30,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:30,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:27:30,569 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:30,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:27:30,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:27:30,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret12 := main(); {3609#true} is VALID [2018-11-23 12:27:30,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,571 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:30,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,572 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:30,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,573 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:30,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,573 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:30,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,575 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:30,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,576 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:30,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,577 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:30,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,579 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:30,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 1000); {3610#false} is VALID [2018-11-23 12:27:30,580 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:30,580 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:30,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,580 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:30,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,581 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:30,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,581 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:30,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:30,582 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:30,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:30,582 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:27:30,582 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:30,582 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:30,583 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:30,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,583 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:30,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,583 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:30,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,584 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:30,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:30,584 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:30,585 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:30,585 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:27:30,585 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:30,585 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:30,585 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:30,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3610#false} is VALID [2018-11-23 12:27:30,585 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:30,585 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 999); {3610#false} is VALID [2018-11-23 12:27:30,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:27:30,586 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:30,586 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:30,586 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,586 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:30,586 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,586 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:30,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {3610#false} is VALID [2018-11-23 12:27:30,586 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:30,587 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 1000); {3610#false} is VALID [2018-11-23 12:27:30,587 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:30,587 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:27:30,587 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:27:30,587 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:30,587 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:30,587 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:27:30,590 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:30,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:30,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:27:30,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:30,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:30,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:27:30,663 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:30,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:27:30,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:27:30,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:30,664 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:27:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,850 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:27:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:27:30,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:27:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:27:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:27:30,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:27:30,943 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:30,944 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:27:30,945 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:27:30,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:27:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:27:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:27:30,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:30,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:30,963 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:30,964 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:27:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,965 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:30,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,966 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:30,966 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:27:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:30,968 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:27:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:27:30,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:30,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:30,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:30,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:27:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:27:30,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:27:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:30,971 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:27:30,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:27:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:27:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:27:30,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:30,972 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:30,972 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:30,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:27:30,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:30,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:31,215 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:31,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:31,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:31,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:31,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:27:31,218 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:31,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:31,218 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:31,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:31,219 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:31,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:31,220 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:31,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:31,222 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:31,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:31,223 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:31,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:31,224 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:31,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:31,225 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:31,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:31,227 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:31,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 1000); {4125#false} is VALID [2018-11-23 12:27:31,228 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:31,228 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:31,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,228 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:31,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,229 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:31,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,229 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:31,229 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,230 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:31,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,230 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:27:31,230 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:31,230 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:31,231 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:31,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,231 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:31,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,231 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:31,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,232 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:31,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,232 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:31,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,232 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:27:31,232 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:31,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:31,233 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:31,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4125#false} is VALID [2018-11-23 12:27:31,233 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:31,233 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:27:31,233 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:31,233 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:31,233 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:31,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,234 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:31,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,234 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:31,234 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,234 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:31,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,234 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:31,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,235 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:31,235 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:31,235 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:31,235 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:31,237 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:31,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:31,238 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:31,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:31,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:27:31,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:31,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:31,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:27:31,461 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:31,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:27:31,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret12 := main(); {4124#true} is VALID [2018-11-23 12:27:31,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:27:31,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,463 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:31,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,463 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:31,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,463 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:31,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,463 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:31,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,464 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:31,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,464 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:31,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,464 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:31,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,465 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:31,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4124#true} is VALID [2018-11-23 12:27:31,465 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:31,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,465 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:31,465 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:31,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,466 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:31,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,466 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:31,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,466 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:31,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,467 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:31,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,467 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:27:31,467 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:31,467 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:31,467 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:31,468 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,468 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:31,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,468 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:31,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4124#true} is VALID [2018-11-23 12:27:31,468 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:31,468 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 1000); {4124#true} is VALID [2018-11-23 12:27:31,469 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:31,469 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:27:31,469 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:27:31,470 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:31,470 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:31,471 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:31,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:31,472 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:31,472 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 999); {4125#false} is VALID [2018-11-23 12:27:31,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:27:31,472 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:31,472 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:31,473 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:31,473 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:31,473 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:31,473 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:31,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4125#false} is VALID [2018-11-23 12:27:31,473 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:31,474 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 1000); {4125#false} is VALID [2018-11-23 12:27:31,474 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:31,474 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:27:31,474 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:27:31,474 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:31,474 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:31,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:27:31,479 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:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:27:31,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:31,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:27:31,582 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:31,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:27:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:27:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:27:31,583 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:27:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,024 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:27:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:27:32,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:27:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:27:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:27:32,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:27:32,114 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:32,116 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:27:32,116 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:27:32,117 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:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:27:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:27:32,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:32,148 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:32,148 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:27:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,150 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:32,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,151 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:32,151 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:27:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,153 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:27:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:27:32,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:27:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:27:32,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:27:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,156 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:27:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:27:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:27:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:27:32,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,157 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:32,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:27:32,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:32,516 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:32,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:32,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:32,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:32,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:27:32,519 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:32,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:32,519 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:32,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:32,520 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:32,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:32,521 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:32,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:32,522 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:32,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:32,523 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:32,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:32,525 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:32,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:32,526 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:32,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:32,527 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:32,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:32,528 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:32,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 1000); {4672#false} is VALID [2018-11-23 12:27:32,529 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:32,529 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:32,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,530 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:32,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,530 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:32,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,531 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:32,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,531 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:32,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,531 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:27:32,531 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:32,532 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:32,532 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:32,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,532 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:32,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,532 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:32,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,532 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:32,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,533 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:32,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,533 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:27:32,533 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:32,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:32,533 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:32,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:32,534 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:32,534 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4672#false} is VALID [2018-11-23 12:27:32,534 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:32,534 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 999); {4672#false} is VALID [2018-11-23 12:27:32,534 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:27:32,534 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:32,534 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:32,534 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,534 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:32,535 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,535 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:32,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,535 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:32,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,535 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:32,535 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,535 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:27:32,536 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:32,536 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:32,536 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:32,539 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:32,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:32,539 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:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:32,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:32,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:32,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:32,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:27:32,795 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:32,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:27:32,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret12 := main(); {4671#true} is VALID [2018-11-23 12:27:32,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:27:32,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,796 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:32,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,796 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:32,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,797 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:32,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,797 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:32,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,797 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:32,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,797 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:32,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,798 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:32,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,798 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:32,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,798 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:32,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4671#true} is VALID [2018-11-23 12:27:32,798 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:32,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,799 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:32,799 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:32,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,799 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:32,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,799 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:32,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,799 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:32,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,800 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:32,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,800 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:27:32,800 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:32,800 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:32,800 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:32,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,801 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:32,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,801 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:32,801 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4671#true} is VALID [2018-11-23 12:27:32,801 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:32,801 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 1000); {4671#true} is VALID [2018-11-23 12:27:32,801 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:32,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:27:32,802 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:27:32,802 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:32,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:32,802 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:32,802 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:32,802 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:32,802 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4671#true} is VALID [2018-11-23 12:27:32,802 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:32,802 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 999); {4671#true} is VALID [2018-11-23 12:27:32,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:27:32,803 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:32,803 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:32,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4873#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:32,823 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:32,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4880#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:32,824 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:32,824 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {4887#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:32,825 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:32,825 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= mapsum_~i~0 3)} assume !(~i~0 < 1000); {4672#false} is VALID [2018-11-23 12:27:32,826 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:32,826 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:27:32,826 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:27:32,826 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:32,826 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:32,827 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:27:32,830 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:32,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:32,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:27:32,853 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:32,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:32,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:33,081 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:33,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:33,082 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:27:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,676 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:27:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:33,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:27:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:27:33,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:27:34,078 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:34,079 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:27:34,080 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:27:34,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:27:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:27:34,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:34,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:34,105 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:34,105 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:27:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:34,107 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:34,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:34,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:34,108 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:34,108 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:27:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:34,110 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:27:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:27:34,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:34,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:34,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:34,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:27:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:27:34,112 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:27:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:27:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:27:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:27:34,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:34,114 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:34,114 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:34,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:27:34,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:34,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:34,388 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:34,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:34,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:34,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:34,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,390 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:34,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,391 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:34,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,391 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:34,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,392 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:34,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,393 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:34,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,395 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:34,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,396 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:34,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,397 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:34,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,398 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:34,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,400 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:34,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,401 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:34,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 1000); {5256#false} is VALID [2018-11-23 12:27:34,402 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:34,402 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:34,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,402 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:34,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,403 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:34,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,403 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:34,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,404 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:34,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:34,404 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:34,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:34,404 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:27:34,404 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:34,405 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:34,405 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:34,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,405 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:34,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,405 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:34,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,406 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:34,406 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,406 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:34,406 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:34,406 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:34,406 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:34,406 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:34,406 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:34,407 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,407 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:34,407 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,407 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:34,407 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,407 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:34,407 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:27:34,407 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:34,407 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:34,408 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:34,408 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,408 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:34,408 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,408 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:34,408 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,408 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:34,408 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5255#true} is VALID [2018-11-23 12:27:34,409 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:34,409 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 1000); {5255#true} is VALID [2018-11-23 12:27:34,409 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:34,409 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:34,409 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:34,409 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:34,409 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:34,409 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:34,413 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:34,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:34,413 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:34,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:34,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:27:34,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:34,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:27:34,864 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:34,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:27:34,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:27:34,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret12 := main(); {5255#true} is VALID [2018-11-23 12:27:34,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:27:34,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,865 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:34,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,866 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:34,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,866 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:34,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,867 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:34,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,867 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:34,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,867 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:34,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,867 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:34,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,868 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:34,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,868 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:34,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,868 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:34,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5255#true} is VALID [2018-11-23 12:27:34,868 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:34,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 1000); {5255#true} is VALID [2018-11-23 12:27:34,868 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:34,869 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:34,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5362#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:34,870 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:34,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5369#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:34,870 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:34,871 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5376#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:34,871 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:34,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5383#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:34,872 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:34,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= mapsum_~i~0 4)} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:34,873 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:34,873 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:34,873 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:27:34,874 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:34,874 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:34,874 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:34,874 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,874 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:34,875 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,875 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:34,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,875 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:34,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,876 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:34,876 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:34,876 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:34,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:34,876 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:27:34,876 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:34,877 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,877 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:34,877 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,877 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:34,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5256#false} is VALID [2018-11-23 12:27:34,878 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:34,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 999); {5256#false} is VALID [2018-11-23 12:27:34,878 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:27:34,878 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:34,878 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:34,878 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,878 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:34,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,879 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:34,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,879 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:34,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5256#false} is VALID [2018-11-23 12:27:34,879 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:34,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 1000); {5256#false} is VALID [2018-11-23 12:27:34,879 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:34,879 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:27:34,880 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:27:34,880 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:34,880 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:34,880 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:27:34,883 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:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:27:34,903 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:34,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:34,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:34,972 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:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:34,973 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:27:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:35,473 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:27:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:35,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:27:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:27:35,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:27:36,233 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:36,235 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:27:36,235 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:27:36,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:27:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:27:36,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:36,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:36,264 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:36,264 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:27:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:36,267 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:36,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:36,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:36,268 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:36,268 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:27:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:36,270 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:27:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:27:36,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:36,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:36,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:27:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:27:36,272 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:27:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:36,273 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:27:36,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:27:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:27:36,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:36,274 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:36,274 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:36,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:27:36,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:36,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:36,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:36,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:36,915 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:36,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:36,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:36,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:36,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:36,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:27:36,917 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:36,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:36,918 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:36,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:36,919 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:36,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:36,920 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:36,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:36,921 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:36,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:36,923 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:36,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:36,924 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:36,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:36,925 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:36,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:36,927 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:36,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:36,928 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:36,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:36,929 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:36,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:36,931 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:36,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 1000); {5889#false} is VALID [2018-11-23 12:27:36,931 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:36,932 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:36,932 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,932 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:36,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,932 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:36,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,933 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:36,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,933 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:36,933 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,934 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:36,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:36,934 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:36,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:36,934 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:27:36,934 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:36,934 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:36,935 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:36,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,935 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:36,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,935 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:36,935 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,935 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:36,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,935 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:36,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,936 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:36,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:36,936 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:36,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:36,936 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:27:36,936 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:36,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:36,936 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:36,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:36,937 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:36,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5889#false} is VALID [2018-11-23 12:27:36,937 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:36,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:27:36,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:36,937 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:36,937 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:36,938 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,938 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:36,938 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,938 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:36,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,938 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:36,938 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,938 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:36,939 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:36,939 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:36,939 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:36,939 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:36,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:36,939 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:36,939 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:36,939 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:36,940 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:36,943 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:36,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:36,944 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:36,952 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:37,053 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:27:37,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:37,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:27:37,265 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:37,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:37,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:27:37,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret12 := main(); {5888#true} is VALID [2018-11-23 12:27:37,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:27:37,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,266 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:37,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,266 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:37,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,267 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:37,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,267 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:37,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,267 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:37,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,267 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:37,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,268 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:37,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,268 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:37,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,268 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:37,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,268 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:37,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,269 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:37,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5888#true} is VALID [2018-11-23 12:27:37,269 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:37,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 1000); {5888#true} is VALID [2018-11-23 12:27:37,269 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:37,269 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:37,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,269 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:37,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,270 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:37,270 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,270 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:37,270 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,270 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:37,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,270 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:37,270 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:37,271 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:37,271 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:37,271 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:27:37,271 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:37,271 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:37,271 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:37,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,271 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:37,272 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,272 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:37,272 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,272 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:37,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,272 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:37,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5888#true} is VALID [2018-11-23 12:27:37,272 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:37,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 1000); {5888#true} is VALID [2018-11-23 12:27:37,273 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:37,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:27:37,273 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:27:37,273 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:37,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:37,274 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:37,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:37,275 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:37,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:37,276 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:37,276 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 999); {5889#false} is VALID [2018-11-23 12:27:37,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:27:37,276 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:37,276 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:37,277 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:37,277 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:37,277 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:37,277 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:37,277 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:37,277 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:37,277 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:37,278 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:37,278 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {5889#false} is VALID [2018-11-23 12:27:37,278 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:37,279 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 1000); {5889#false} is VALID [2018-11-23 12:27:37,279 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:37,279 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:27:37,279 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:27:37,280 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:37,280 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:37,280 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:27:37,284 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:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:27:37,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:37,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:37,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:27:37,383 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:37,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:27:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:27:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:37,384 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:27:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:37,999 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:27:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:37,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:27:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:27:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:27:38,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:27:38,462 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:38,464 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:27:38,464 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:27:38,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:27:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:27:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:27:38,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:38,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:38,492 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:38,493 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:27:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,496 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:38,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,497 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:38,497 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:27:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:38,499 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:27:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:38,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:38,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:38,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:38,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:27:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:27:38,501 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:27:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:38,501 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:27:38,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:27:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:27:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:27:38,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:38,503 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:38,503 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:38,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:27:38,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:38,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:38,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:39,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:39,143 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:39,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:39,143 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:39,143 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:39,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:39,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:27:39,145 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:39,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:39,146 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:39,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:39,147 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:39,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:39,147 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:39,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:39,149 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:39,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:39,150 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:39,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:39,151 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:39,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:39,153 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:39,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:39,154 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:39,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:39,155 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:39,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:39,156 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:39,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:39,158 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:39,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:39,159 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:39,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:27:39,160 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:39,160 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:39,160 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,161 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:39,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,161 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:39,161 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,162 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:39,162 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,162 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:39,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,162 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:39,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:39,163 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:39,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:39,163 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:39,163 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:39,163 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:39,163 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:39,164 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,164 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:39,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,164 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:39,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,164 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:39,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,164 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:39,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,165 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:39,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:39,165 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:39,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:39,165 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:39,165 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:39,165 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,165 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:39,166 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,166 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:39,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,166 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:39,166 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,166 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:39,166 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:27:39,166 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:39,166 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:39,167 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:39,167 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,167 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:39,167 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,167 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:39,167 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,167 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:39,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,168 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:39,168 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6568#true} is VALID [2018-11-23 12:27:39,168 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:39,168 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 1000); {6568#true} is VALID [2018-11-23 12:27:39,168 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:39,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:39,168 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:39,168 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:39,168 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:39,169 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:39,173 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:39,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:39,173 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:39,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:39,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:39,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:27:39,723 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:39,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:27:39,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:27:39,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret12 := main(); {6568#true} is VALID [2018-11-23 12:27:39,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:39,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:39,726 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:39,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:39,726 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:39,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:39,728 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:39,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:39,729 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:39,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:39,731 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:39,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:39,732 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:39,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:39,734 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:39,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:39,735 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:39,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:39,737 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:39,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:39,738 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:39,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:39,740 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:39,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:39,741 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:39,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:39,743 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:39,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 1000); {6569#false} is VALID [2018-11-23 12:27:39,744 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:39,744 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:39,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,745 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:39,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,745 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:39,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,746 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:39,746 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,746 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:39,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,747 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:39,747 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:39,747 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:39,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:39,747 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:27:39,748 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:39,748 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:39,748 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:39,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,748 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:39,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,749 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:39,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,749 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:39,749 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,749 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:39,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,749 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:39,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:39,750 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:39,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:39,750 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:27:39,750 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:39,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,750 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:39,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,751 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:39,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,751 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:39,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6569#false} is VALID [2018-11-23 12:27:39,751 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:39,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 999); {6569#false} is VALID [2018-11-23 12:27:39,752 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:27:39,752 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:39,752 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:39,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,752 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:39,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,753 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:39,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,753 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:39,753 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,753 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:39,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {6569#false} is VALID [2018-11-23 12:27:39,754 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:39,754 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 1000); {6569#false} is VALID [2018-11-23 12:27:39,754 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:39,754 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:27:39,754 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:27:39,754 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:39,754 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:39,755 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:27:39,763 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:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:39,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:27:39,783 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:39,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:39,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:27:39,864 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:39,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:27:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:27:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:27:39,866 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:27:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,574 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:27:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:27:40,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:27:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:27:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:27:40,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:27:40,661 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:40,663 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:27:40,663 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:27:40,664 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:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:27:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:27:40,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:40,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:40,694 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:40,694 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:27:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,696 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:40,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,698 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:40,698 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:27:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,700 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:27:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:27:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:40,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:27:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:27:40,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:27:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:40,703 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:27:40,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:27:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:27:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:27:40,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:40,705 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:40,705 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:40,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:27:40,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:40,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:40,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:40,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:41,003 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:41,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:41,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:41,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:41,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:41,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:27:41,005 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:41,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:41,006 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:41,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,007 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:41,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,008 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:41,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,009 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:41,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,010 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:41,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,011 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:41,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,013 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:41,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,014 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:41,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,015 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:41,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,016 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:41,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,018 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:41,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,019 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:41,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,020 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:41,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:27:41,021 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:41,021 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:41,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,021 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:41,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,022 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:41,022 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,022 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:41,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,023 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:41,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,023 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:41,023 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:41,023 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:41,024 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:41,024 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:41,024 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:41,024 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:41,024 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:41,025 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,025 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:41,025 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,025 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:41,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,025 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:41,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,026 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:41,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,026 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:41,026 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:41,026 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:41,026 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:41,027 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:41,027 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:41,027 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,027 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:41,027 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,027 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:41,028 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,028 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:41,028 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,028 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:41,028 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:27:41,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:41,029 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:41,029 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:41,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,029 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:41,029 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,029 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:41,030 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,030 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:41,030 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,030 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:41,030 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7268#true} is VALID [2018-11-23 12:27:41,030 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:41,031 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 1000); {7268#true} is VALID [2018-11-23 12:27:41,031 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:41,031 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:41,031 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:41,031 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:41,031 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:41,032 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:41,037 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:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:41,037 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:41,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:41,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:41,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:41,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:27:41,331 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:41,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:27:41,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:27:41,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret12 := main(); {7268#true} is VALID [2018-11-23 12:27:41,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:41,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:41,334 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:41,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:41,335 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:41,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,336 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:41,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,337 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:41,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,338 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:41,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,339 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:41,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,341 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:41,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,342 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:41,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,343 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:41,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,344 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:41,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,346 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:41,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,347 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:41,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,348 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:41,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,350 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:41,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 1000); {7269#false} is VALID [2018-11-23 12:27:41,351 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:41,351 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:41,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,351 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:41,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,352 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:41,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,352 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:41,352 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,352 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:41,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,353 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:41,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:41,353 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:41,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:41,354 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:27:41,354 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:41,354 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:41,354 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:41,354 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,355 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:41,355 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,355 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:41,355 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,355 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:41,355 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,356 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:41,356 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,356 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:41,356 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:41,356 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:41,356 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:41,356 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:27:41,356 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:41,356 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,357 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:41,357 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,357 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:41,357 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,357 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:41,357 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7269#false} is VALID [2018-11-23 12:27:41,357 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:41,357 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 999); {7269#false} is VALID [2018-11-23 12:27:41,358 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:27:41,358 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:41,358 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:41,358 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,358 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:41,358 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,358 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:41,358 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,358 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:41,359 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,359 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:41,359 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7269#false} is VALID [2018-11-23 12:27:41,359 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:41,359 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 1000); {7269#false} is VALID [2018-11-23 12:27:41,359 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:41,359 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:27:41,359 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:27:41,360 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:41,360 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:41,360 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:27:41,364 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:41,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:41,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:27:41,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:41,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:41,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:27:41,472 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:41,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:27:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:27:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:27:41,473 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:27:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:41,907 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:27:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:27:41,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:27:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:27:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:27:41,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:27:42,008 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:42,010 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:27:42,010 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:27:42,011 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:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:27:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:27:42,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:42,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:42,042 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:42,042 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:27:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,044 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:42,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,044 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:42,045 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:27:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,046 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:27:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:27:42,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:42,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:42,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:42,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:27:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:27:42,049 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:27:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:42,049 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:27:42,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:27:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:27:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:27:42,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:42,050 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:42,050 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:42,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:27:42,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:42,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:42,374 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:42,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:42,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:42,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:42,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:27:42,376 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:42,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:42,377 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:42,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:42,378 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:42,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:42,379 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:42,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:42,380 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:42,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:42,382 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:42,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:42,383 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:42,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:42,384 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:42,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:42,386 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:42,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:42,387 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:42,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:42,388 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:42,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:42,390 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:42,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:42,391 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:42,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:42,392 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:42,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:42,393 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:42,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 1000); {7986#false} is VALID [2018-11-23 12:27:42,394 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:42,395 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:42,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,395 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:42,395 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,395 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:42,396 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,396 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:42,396 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,396 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:42,396 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,397 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:42,397 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,397 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:42,397 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,397 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:27:42,397 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:42,398 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:42,398 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:42,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,398 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:42,398 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,398 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:42,398 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,398 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:42,398 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,399 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:42,399 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,399 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:42,399 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,399 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:42,399 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,399 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:27:42,399 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:42,400 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:42,400 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:42,400 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:42,400 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:42,400 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:42,400 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:42,400 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7986#false} is VALID [2018-11-23 12:27:42,400 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:42,400 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 999); {7986#false} is VALID [2018-11-23 12:27:42,401 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:27:42,401 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:42,401 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:42,401 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,401 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:42,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,401 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:42,401 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,402 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:42,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,402 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:42,402 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,402 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:42,402 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,402 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:42,402 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,402 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:27:42,403 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:42,403 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:42,403 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:42,407 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:42,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:42,408 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:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:42,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:27:42,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:42,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:42,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:27:42,676 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:42,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:27:42,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret12 := main(); {7985#true} is VALID [2018-11-23 12:27:42,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:27:42,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,677 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:42,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,677 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:42,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,678 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:42,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,678 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:42,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,679 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:42,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,679 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:42,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,679 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:42,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,680 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:42,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,680 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:42,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,680 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:42,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,680 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:42,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,681 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:42,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,681 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:42,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,681 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:42,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7985#true} is VALID [2018-11-23 12:27:42,681 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:42,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,682 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:42,682 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:42,682 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,682 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:42,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,682 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:42,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,682 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:42,682 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,683 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:42,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,683 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:42,683 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,683 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:42,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,683 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:27:42,683 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:42,684 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:42,684 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:42,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,684 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:42,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,684 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:42,684 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,684 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:42,684 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,685 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:42,685 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {7985#true} is VALID [2018-11-23 12:27:42,685 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:42,685 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 1000); {7985#true} is VALID [2018-11-23 12:27:42,685 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:42,685 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:27:42,685 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:27:42,685 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:42,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:42,686 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:42,686 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:42,686 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:42,686 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:42,686 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:42,686 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7985#true} is VALID [2018-11-23 12:27:42,686 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:42,686 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 999); {7985#true} is VALID [2018-11-23 12:27:42,687 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:27:42,687 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:42,687 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:42,687 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8252#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:42,688 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:42,688 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8259#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:42,689 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:42,689 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8266#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:42,690 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:42,690 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8273#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:42,691 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:42,691 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8280#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:42,692 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:42,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= mapsum_~i~0 5)} assume !(~i~0 < 1000); {7986#false} is VALID [2018-11-23 12:27:42,693 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:42,693 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:27:42,693 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:27:42,693 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:42,694 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:42,694 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:27:42,698 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:42,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:27:42,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:42,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:42,836 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:42,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:42,837 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:27:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,258 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:27:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:27:43,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:27:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:27:43,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:27:43,450 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:43,452 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:27:43,452 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:27:43,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:27:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:27:43,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:43,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:43,507 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:43,507 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:27:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,509 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:43,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,509 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:43,510 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:27:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,511 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:27:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:43,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:43,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:27:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:27:43,514 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:27:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:43,514 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:27:43,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:27:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:27:43,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:43,516 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:43,516 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:43,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:27:43,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:43,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:43,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:43,928 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:43,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:43,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:43,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:43,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:43,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:27:43,930 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:43,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:43,930 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:43,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:43,931 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:43,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:43,932 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:43,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:43,933 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:43,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:43,935 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:43,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:43,936 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:43,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:43,937 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:43,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:43,938 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:43,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:43,940 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:43,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:43,941 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:43,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:43,942 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:43,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:43,944 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:43,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:43,945 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:43,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:43,946 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:43,947 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:43,948 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:43,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:27:43,948 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:43,949 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:43,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,949 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:43,949 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,949 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:43,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,950 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:43,950 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,950 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:43,950 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,951 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:43,951 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,951 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:43,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:43,951 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:43,951 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:43,951 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:43,952 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:43,952 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:43,952 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:43,952 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,952 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:43,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,952 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:43,952 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,953 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:43,953 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,953 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:43,953 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,953 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:43,953 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,953 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:43,953 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:43,953 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:43,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:43,954 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:43,954 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:43,954 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:43,954 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:43,954 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:43,954 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:43,954 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:43,954 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:43,955 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:43,955 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:43,955 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:27:43,955 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:43,955 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:43,955 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:43,955 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,955 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:43,956 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,956 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:43,956 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,956 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:43,956 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,956 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:43,956 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,956 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:43,956 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8737#true} is VALID [2018-11-23 12:27:43,957 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:43,957 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 1000); {8737#true} is VALID [2018-11-23 12:27:43,957 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:43,957 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:43,957 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:43,957 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:43,957 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:43,957 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:43,963 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:43,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:43,963 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:43,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:44,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:44,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:44,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:44,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:27:44,244 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:44,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:27:44,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:27:44,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret12 := main(); {8737#true} is VALID [2018-11-23 12:27:44,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:44,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:44,246 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:44,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:44,247 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:44,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:44,248 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:44,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:44,249 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:44,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:44,250 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:44,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:44,252 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:44,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:44,253 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:44,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:44,254 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:44,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:44,255 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:44,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:44,257 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:44,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:44,258 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:44,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:44,259 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:44,260 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:44,261 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:44,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:44,262 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:44,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:44,263 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:44,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:44,264 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:44,265 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 1000); {8738#false} is VALID [2018-11-23 12:27:44,265 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:44,266 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:44,266 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,266 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:44,266 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,266 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:44,267 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,267 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:44,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,267 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:44,267 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,267 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:44,268 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,268 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:44,268 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:44,268 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:44,268 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:44,269 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:27:44,269 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:44,269 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:44,269 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:44,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,270 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:44,270 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,270 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:44,270 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,270 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:44,270 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,270 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:44,270 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,270 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:44,271 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,271 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:44,271 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:44,271 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:44,271 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:44,271 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:27:44,271 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:44,271 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:44,271 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:44,272 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:44,272 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:44,272 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:44,272 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:44,272 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8738#false} is VALID [2018-11-23 12:27:44,272 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:44,272 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 999); {8738#false} is VALID [2018-11-23 12:27:44,272 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:27:44,273 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:44,273 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:44,273 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,273 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:44,273 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,273 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:44,273 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,273 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:44,273 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,274 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:44,274 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,274 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:44,274 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {8738#false} is VALID [2018-11-23 12:27:44,274 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:44,274 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 1000); {8738#false} is VALID [2018-11-23 12:27:44,274 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:44,274 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:27:44,274 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:27:44,275 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:44,275 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:44,275 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:27:44,280 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:44,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:44,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:27:44,300 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:44,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:44,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:27:44,371 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:44,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:27:44,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:27:44,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:44,372 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:27:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:44,883 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:27:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:27:44,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:27:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:27:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:27:44,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:27:45,092 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:45,094 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:27:45,094 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:27:45,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:27:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:27:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:27:45,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:45,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:45,129 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:45,129 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:27:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,131 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:45,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,132 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:45,132 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:27:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:45,133 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:27:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:27:45,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:45,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:45,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:45,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:27:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:27:45,136 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:27:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:45,136 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:27:45,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:27:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:27:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:27:45,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:45,137 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:45,138 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:45,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:27:45,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:45,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:45,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:45,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:46,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:46,198 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:46,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:46,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:46,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:46,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:27:46,200 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:46,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:46,201 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:46,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:46,202 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:46,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:46,203 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:46,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:46,204 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:46,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:46,205 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:46,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:46,207 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:46,207 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:46,208 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:46,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:46,209 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:46,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:46,210 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:46,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:46,212 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:46,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:46,215 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:46,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:46,216 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:46,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:46,217 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:46,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:46,218 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:46,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:46,219 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:46,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:46,255 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:46,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 1000); {9520#false} is VALID [2018-11-23 12:27:46,264 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:46,264 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:46,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,264 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:46,265 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,265 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:46,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,265 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:46,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,265 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:46,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,266 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:46,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,266 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:46,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:46,266 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:46,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:46,267 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:27:46,267 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:46,267 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:46,267 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:46,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,267 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:46,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,268 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:46,268 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,268 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:46,268 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,268 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:46,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,269 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:46,269 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,269 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:46,269 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:46,269 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:46,269 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:46,269 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:46,270 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:46,270 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:46,270 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:46,270 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:46,270 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:46,270 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:46,271 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:46,271 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:46,271 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:46,271 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:27:46,271 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:46,271 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:46,272 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:46,272 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,272 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:46,272 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,272 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:46,272 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,273 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:46,273 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,273 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:46,273 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,273 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:46,273 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9519#true} is VALID [2018-11-23 12:27:46,274 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:46,274 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 1000); {9519#true} is VALID [2018-11-23 12:27:46,274 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:46,274 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:46,274 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:46,274 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:46,274 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:46,275 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:46,282 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:46,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:46,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:47,303 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:27:47,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:47,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:47,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:27:47,600 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:47,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:27:47,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:27:47,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret12 := main(); {9519#true} is VALID [2018-11-23 12:27:47,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:27:47,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,602 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:47,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,603 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:47,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,603 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:47,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,603 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:47,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,604 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:47,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,604 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:47,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,604 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:47,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,605 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:47,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,605 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:47,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,606 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:47,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,606 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:47,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,606 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:47,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,606 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:47,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,607 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:47,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,607 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:47,607 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,607 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:47,608 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9519#true} is VALID [2018-11-23 12:27:47,608 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:47,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 1000); {9519#true} is VALID [2018-11-23 12:27:47,608 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:47,624 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:47,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9668#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:27:47,634 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:47,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9675#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:27:47,634 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:47,635 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9682#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:27:47,635 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:47,636 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9689#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:27:47,636 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:47,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9696#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:27:47,637 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:47,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9703#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:27:47,638 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:47,639 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= mapsum_~i~0 6)} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:47,639 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:47,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:47,639 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:27:47,640 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:47,640 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:47,640 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:47,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,640 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:47,641 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,641 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:47,641 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,641 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:47,641 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,641 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:47,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,642 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:47,642 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,642 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:47,642 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:47,643 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:47,643 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:47,643 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:27:47,643 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:47,643 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:47,643 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:47,643 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:47,644 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:47,644 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:47,644 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:47,644 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9520#false} is VALID [2018-11-23 12:27:47,644 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:47,644 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 999); {9520#false} is VALID [2018-11-23 12:27:47,644 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:27:47,644 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:47,644 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:47,645 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,645 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:47,645 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,645 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:47,645 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,645 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:47,645 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,645 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:47,645 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,646 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:47,646 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {9520#false} is VALID [2018-11-23 12:27:47,646 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:47,646 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 1000); {9520#false} is VALID [2018-11-23 12:27:47,646 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:47,646 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:27:47,646 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:27:47,646 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:47,646 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:47,647 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:27:47,651 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:47,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:47,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:27:47,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:47,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:47,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:27:47,770 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:47,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:27:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:27:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:47,772 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:27:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,468 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:27:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:27:48,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:27:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:27:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:27:48,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:27:48,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:48,656 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:27:48,656 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:27:48,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:27:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:27:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:27:48,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:48,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:48,697 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:48,697 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:27:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,699 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:48,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,700 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:48,700 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:27:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:48,702 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:27:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:27:48,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:48,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:48,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:48,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:27:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:27:48,705 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:27:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:48,705 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:27:48,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:27:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:27:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:27:48,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:48,706 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:48,707 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:48,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:27:48,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:49,052 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:49,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:49,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:49,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,053 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:49,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,054 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:49,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,055 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:49,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,055 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:49,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,057 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:49,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,058 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:49,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,059 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:49,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,062 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:49,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,065 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:49,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,065 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:49,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,066 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:49,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,067 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:49,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,071 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:49,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,071 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:49,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,072 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:49,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,073 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:49,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,074 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:49,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,074 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:49,075 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 1000); {10338#false} is VALID [2018-11-23 12:27:49,075 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:49,076 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:49,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,076 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:49,076 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,076 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:49,076 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,077 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:49,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,077 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:49,077 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,077 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:49,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,078 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:49,078 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,078 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:49,078 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,078 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:49,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,078 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:27:49,078 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:49,079 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:49,079 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:49,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,079 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:49,079 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,079 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:49,079 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,079 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:49,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,080 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:49,080 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,080 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:49,080 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,080 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:49,080 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,080 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:49,080 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,081 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:49,081 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,081 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:27:49,081 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:49,081 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:49,081 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:49,081 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:49,081 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:49,081 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:49,082 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:49,082 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10338#false} is VALID [2018-11-23 12:27:49,082 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:49,082 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:27:49,082 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:49,082 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:49,082 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:49,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,082 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:49,083 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,083 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:49,083 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,083 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:49,083 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,083 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:49,083 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,083 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:49,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,084 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:49,084 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,084 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:49,084 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,084 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:49,084 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,084 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:49,084 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:49,084 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:49,085 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:49,091 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:49,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:49,091 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:49,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:49,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:27:49,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:49,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:27:49,460 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:49,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:27:49,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret12 := main(); {10337#true} is VALID [2018-11-23 12:27:49,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:27:49,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,461 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:49,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,461 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:49,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,462 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:49,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,462 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:49,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,462 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:49,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,462 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:49,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,463 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:49,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,463 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:49,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,463 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:49,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,463 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:49,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,463 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:49,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,464 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:49,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,464 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:49,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,464 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:49,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,464 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:49,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,465 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:49,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,465 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:49,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10337#true} is VALID [2018-11-23 12:27:49,465 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:49,465 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,465 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:49,465 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:49,465 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,466 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:49,466 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,466 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:49,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,466 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:49,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,466 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:49,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,466 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:49,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,467 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:49,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,467 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:49,467 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,467 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:49,467 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,467 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:27:49,468 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:49,468 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:49,468 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:49,468 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,468 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:49,468 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,468 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:49,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,468 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:49,469 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,469 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:49,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,469 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:49,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,469 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:49,469 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10337#true} is VALID [2018-11-23 12:27:49,469 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:49,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 1000); {10337#true} is VALID [2018-11-23 12:27:49,470 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:49,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:27:49,470 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:27:49,470 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:49,471 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:49,471 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:49,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:49,472 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:49,472 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:49,473 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:49,473 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:49,473 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:49,474 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 999); {10338#false} is VALID [2018-11-23 12:27:49,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:27:49,474 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:49,474 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:49,474 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,474 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:49,475 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,475 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:49,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,475 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:49,475 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,476 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:49,476 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,476 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:49,476 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,476 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:49,477 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {10338#false} is VALID [2018-11-23 12:27:49,477 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:49,477 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 1000); {10338#false} is VALID [2018-11-23 12:27:49,477 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:49,477 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:27:49,478 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:27:49,478 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:49,478 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:49,478 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:27:49,484 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:49,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:49,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:27:49,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:49,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:49,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:49,593 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:49,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:49,595 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:27:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,435 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:27:50,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:27:50,435 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:27:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:27:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:27:50,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:27:50,805 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:50,807 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:27:50,807 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:27:50,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:27:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:27:50,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:50,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:50,847 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:50,847 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:27:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,849 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:50,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:50,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:50,850 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:50,850 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:27:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:50,851 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:27:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:50,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:50,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:50,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:50,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:27:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:27:50,853 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:27:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:50,853 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:27:50,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:27:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:27:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:27:50,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:50,854 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:50,854 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:50,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:27:50,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:50,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:50,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:51,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:27:51,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:51,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:51,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:27:51,253 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:51,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,263 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,265 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,269 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,269 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:51,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:27:51,274 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:51,274 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:51,274 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,274 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:51,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,275 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:51,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,275 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:51,275 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,275 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:51,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,276 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:51,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,276 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:51,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,277 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:51,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:51,277 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:51,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,277 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:51,277 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:51,277 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:51,277 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:51,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,278 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:51,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,278 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:51,278 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,278 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:51,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,278 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:51,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,279 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:51,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,279 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:51,279 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,279 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:51,279 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:51,279 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:51,279 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,279 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,280 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:27:51,281 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:51,281 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:51,281 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:51,281 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,281 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:51,282 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,282 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:51,282 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,282 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:51,282 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,282 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:51,282 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,282 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:51,282 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,283 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:51,283 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11201#true} is VALID [2018-11-23 12:27:51,283 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:51,283 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 1000); {11201#true} is VALID [2018-11-23 12:27:51,283 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:51,283 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,283 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11202#false} is VALID [2018-11-23 12:27:51,283 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:27:51,284 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:27:51,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:51,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 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:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:51,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:51,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:27:51,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:27:51,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:27:51,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:27:51,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret12 := main(); {11201#true} is VALID [2018-11-23 12:27:51,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:51,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:51,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {11241#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:51,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:51,695 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:51,696 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:51,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:51,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:51,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:51,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:51,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:51,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:51,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:51,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:51,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:51,709 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:51,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:51,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:51,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,713 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:51,714 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:51,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:51,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 1000); {11202#false} is VALID [2018-11-23 12:27:51,716 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:51,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,717 INFO L273 TraceCheckUtils]: 52: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:51,719 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:51,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:27:51,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:51,720 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:51,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 75: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:51,721 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:51,722 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,722 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 999); {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:27:51,723 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:51,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11202#false} is VALID [2018-11-23 12:27:51,723 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 108: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,724 INFO L273 TraceCheckUtils]: 110: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 112: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {11202#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 1000); {11202#false} is VALID [2018-11-23 12:27:51,725 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:51,725 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:27:51,725 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11202#false} is VALID [2018-11-23 12:27:51,726 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:27:51,726 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:27:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:27:51,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:51,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:27:51,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:51,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:51,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:27:51,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:51,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:27:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:27:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:51,828 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:27:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,498 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:27:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:27:52,498 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:27:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:27:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:27:52,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:27:52,636 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:52,637 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:27:52,638 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:27:52,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:27:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:27:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:27:52,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:52,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:52,671 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:52,671 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:27:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,672 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:52,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,673 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:52,673 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:27:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,674 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:27:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:27:52,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:52,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:52,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:52,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:27:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:27:52,677 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:27:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:52,677 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:27:52,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:27:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:27:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:27:52,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:52,679 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:52,679 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:52,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:52,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:27:52,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:52,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:53,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:53,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {12084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12084#true} is VALID [2018-11-23 12:27:53,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:53,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:53,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:53,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:27:53,852 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:53,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:53,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:53,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:53,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:53,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:53,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:53,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:53,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:53,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:53,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:53,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:53,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:53,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:53,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:53,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:53,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:53,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:53,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:53,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:53,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:53,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:53,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:53,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:53,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:53,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:53,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:53,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:53,872 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:53,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:53,873 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:53,874 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:53,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:53,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:27:53,875 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:53,875 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:53,876 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,876 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:53,876 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,876 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:53,876 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,876 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:53,877 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,877 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:53,877 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,877 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:53,877 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,878 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:53,878 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,878 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:53,878 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:53,878 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:53,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:53,878 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:53,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:53,879 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:53,879 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:53,879 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,879 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:53,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,879 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:53,879 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,879 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:53,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,880 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:53,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,880 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:53,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,880 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:53,880 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,881 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:53,881 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:53,881 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:53,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:53,881 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:53,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:53,882 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:27:53,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:53,884 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:53,884 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:53,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,884 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:53,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,885 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:53,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,885 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:53,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,885 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:53,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,886 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:53,886 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,886 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:53,886 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12084#true} is VALID [2018-11-23 12:27:53,886 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:53,886 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 1000); {12084#true} is VALID [2018-11-23 12:27:53,887 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:53,887 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:53,887 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:53,887 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12085#false} is VALID [2018-11-23 12:27:53,887 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:27:53,887 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:27:53,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:53,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:53,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:53,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:54,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:54,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:27:54,234 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:54,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:27:54,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:27:54,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret12 := main(); {12084#true} is VALID [2018-11-23 12:27:54,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:54,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:54,237 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:54,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:54,238 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:54,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:54,239 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:54,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:54,240 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:54,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:54,242 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:54,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:54,243 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:54,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:54,245 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:54,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:54,246 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:54,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:54,247 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:54,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:54,249 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:54,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:54,250 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:54,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:54,251 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:54,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:54,253 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:54,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:54,254 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:54,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:54,256 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:54,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:54,292 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:54,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:54,314 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:54,329 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:54,338 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:54,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:54,362 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:54,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:54,386 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:54,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 1000); {12085#false} is VALID [2018-11-23 12:27:54,395 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:54,395 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:54,395 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,396 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:54,396 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,396 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:54,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,396 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:54,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,397 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:54,397 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,397 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:54,397 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,398 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:54,398 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,398 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:54,398 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:54,398 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:54,399 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:54,399 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:27:54,399 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:54,399 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:54,400 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:54,400 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,400 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:54,400 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,400 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:54,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,401 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:54,401 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,401 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:54,401 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,402 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:54,402 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,402 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:54,402 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,402 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:54,402 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:54,403 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:54,403 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:54,403 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:27:54,403 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:54,403 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:54,404 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:54,404 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:54,404 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:54,404 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:54,404 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:54,405 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:54,405 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:54,405 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12085#false} is VALID [2018-11-23 12:27:54,405 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:54,405 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 999); {12085#false} is VALID [2018-11-23 12:27:54,406 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:27:54,406 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:54,406 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:54,406 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,407 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:54,407 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,407 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:54,407 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,407 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:54,408 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,408 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:54,408 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,408 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:54,408 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,409 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:54,409 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12085#false} is VALID [2018-11-23 12:27:54,409 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:54,409 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 1000); {12085#false} is VALID [2018-11-23 12:27:54,409 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:54,410 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:27:54,410 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:27:54,410 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:54,410 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:54,410 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:27:54,429 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:54,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:54,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:27:54,463 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:54,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:54,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:27:54,645 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:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:27:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:27:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:54,647 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:27:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,058 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:27:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:27:55,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:27:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:27:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:27:55,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:27:55,191 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:55,193 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:27:55,194 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:27:55,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:27:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:27:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:27:55,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:55,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:55,227 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:55,227 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:27:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,229 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:55,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,230 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:55,230 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:27:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:55,232 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:27:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:27:55,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:55,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:55,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:55,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:27:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:27:55,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:27:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:55,235 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:27:55,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:27:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:27:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:27:55,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:55,237 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:55,237 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:55,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:55,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:27:55,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:55,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:55,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:55,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:56,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:27:56,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:56,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:56,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:27:56,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:27:56,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:56,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:56,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {12987#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:56,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:56,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {12988#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:56,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:56,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {12989#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:56,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:56,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {12990#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:56,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:56,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {12991#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:56,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:56,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {12992#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:56,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:56,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {12993#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:56,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:56,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {12994#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:56,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:56,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {12995#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:56,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:56,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {12996#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:56,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:56,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {12997#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:56,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:56,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {12998#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:56,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:56,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {12999#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:56,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:56,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {13000#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:56,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:56,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:56,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:56,646 INFO L273 TraceCheckUtils]: 39: Hoare triple {13002#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:56,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:56,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {13003#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:56,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:56,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {13004#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:56,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:56,649 INFO L273 TraceCheckUtils]: 45: Hoare triple {13005#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:56,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:56,650 INFO L273 TraceCheckUtils]: 47: Hoare triple {13006#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13007#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:56,651 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 1000); {12985#false} is VALID [2018-11-23 12:27:56,651 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:27:56,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,653 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,654 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:27:56,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,654 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:27:56,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {12985#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:56,655 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:27:56,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:56,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,655 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,657 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:27:56,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,657 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {12985#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {12985#false} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 92: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:56,657 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 96: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 98: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:56,658 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12985#false} is VALID [2018-11-23 12:27:56,659 INFO L273 TraceCheckUtils]: 100: Hoare triple {12985#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12985#false} is VALID [2018-11-23 12:27:56,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:27:56,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:56,659 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:27:56,659 INFO L273 TraceCheckUtils]: 104: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:56,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 106: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 108: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 114: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 116: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,661 INFO L273 TraceCheckUtils]: 118: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,662 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,662 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:27:56,662 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,662 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:56,662 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12985#false} is VALID [2018-11-23 12:27:56,662 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:27:56,662 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:27:56,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:56,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:56,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:27:56,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:56,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:56,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret12 := main(); {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:27:56,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {12984#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12984#true} is VALID [2018-11-23 12:27:56,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,960 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:27:56,960 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,961 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,962 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,962 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:27:56,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,962 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:27:56,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {12984#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12984#true} is VALID [2018-11-23 12:27:56,962 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:27:56,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12984#true} is VALID [2018-11-23 12:27:56,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,964 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12984#true} is VALID [2018-11-23 12:27:56,964 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12984#true} is VALID [2018-11-23 12:27:56,964 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 1000); {12984#true} is VALID [2018-11-23 12:27:56,964 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:27:56,964 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:27:56,964 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:27:56,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {12984#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:56,965 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:56,965 INFO L273 TraceCheckUtils]: 92: Hoare triple {13281#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:56,966 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:56,966 INFO L273 TraceCheckUtils]: 94: Hoare triple {13288#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:56,967 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:56,967 INFO L273 TraceCheckUtils]: 96: Hoare triple {13295#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:56,967 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:56,968 INFO L273 TraceCheckUtils]: 98: Hoare triple {13302#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:56,968 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:56,969 INFO L273 TraceCheckUtils]: 100: Hoare triple {13309#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13316#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:56,970 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 999); {12985#false} is VALID [2018-11-23 12:27:56,970 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:27:56,970 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:27:56,970 INFO L273 TraceCheckUtils]: 104: Hoare triple {12985#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12985#false} is VALID [2018-11-23 12:27:56,970 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 106: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 108: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 110: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,971 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,972 INFO L273 TraceCheckUtils]: 112: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,972 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,972 INFO L273 TraceCheckUtils]: 114: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,972 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,972 INFO L273 TraceCheckUtils]: 116: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 118: Hoare triple {12985#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 1000); {12985#false} is VALID [2018-11-23 12:27:56,973 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:27:56,973 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:27:56,973 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:27:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-23 12:27:56,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:56,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:27:57,000 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:57,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:57,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:57,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:57,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:57,105 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:27:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,709 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:27:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:27:57,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:27:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:27:57,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:27:57,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:57,834 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:27:57,834 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:27:57,835 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:27:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:27:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:27:57,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:57,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:57,881 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:57,881 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:27:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,883 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:57,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,884 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:57,884 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:27:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,885 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:27:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:27:57,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:57,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:27:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:27:57,888 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:27:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:27:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:27:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:27:57,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:57,890 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:57,890 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:57,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:27:57,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:57,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:58,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:58,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:27:58,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:58,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:58,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:58,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:27:58,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:27:58,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {13921#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:58,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:58,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:58,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:58,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:58,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:58,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:58,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:58,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,485 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,485 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,490 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,492 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,496 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,498 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,498 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:58,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:58,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:58,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:58,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:27:58,509 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:27:58,509 INFO L273 TraceCheckUtils]: 52: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 54: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,509 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 60: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,510 INFO L273 TraceCheckUtils]: 66: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:58,511 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:27:58,511 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:58,511 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:58,511 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:58,511 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:27:58,511 INFO L273 TraceCheckUtils]: 73: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:58,511 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,511 INFO L273 TraceCheckUtils]: 75: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 77: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 79: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 81: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,512 INFO L273 TraceCheckUtils]: 85: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 87: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:58,513 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:27:58,513 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:58,513 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,513 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,514 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:58,515 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:27:58,515 INFO L273 TraceCheckUtils]: 108: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13919#true} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 110: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 112: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,515 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 114: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 116: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 118: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 120: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13919#true} is VALID [2018-11-23 12:27:58,516 INFO L273 TraceCheckUtils]: 122: Hoare triple {13919#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#true} is VALID [2018-11-23 12:27:58,517 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 1000); {13919#true} is VALID [2018-11-23 12:27:58,517 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:27:58,517 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:58,517 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:58,517 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13920#false} is VALID [2018-11-23 12:27:58,517 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:27:58,517 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:27:58,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:58,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:58,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:58,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:58,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:58,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:59,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:27:59,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:27:59,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:27:59,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:27:59,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret12 := main(); {13919#true} is VALID [2018-11-23 12:27:59,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:59,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:59,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:59,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:59,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:59,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:59,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:59,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:59,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:59,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:59,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:59,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:59,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:59,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:59,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:59,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:59,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:59,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:59,062 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:59,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:59,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:59,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:59,064 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:59,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:59,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:59,066 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:59,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:59,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:59,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:59,069 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:59,069 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:59,070 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:59,071 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:59,071 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:59,072 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:59,072 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:59,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:59,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:59,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:59,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:59,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:59,076 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:59,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:59,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:59,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:59,079 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 1000); {13920#false} is VALID [2018-11-23 12:27:59,079 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:27:59,079 INFO L273 TraceCheckUtils]: 52: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:59,079 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,080 INFO L273 TraceCheckUtils]: 56: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,081 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,081 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,082 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,082 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:59,082 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:27:59,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:59,083 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:27:59,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:59,083 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:27:59,083 INFO L273 TraceCheckUtils]: 73: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:59,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 79: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,084 INFO L273 TraceCheckUtils]: 83: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 85: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 87: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:59,085 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:27:59,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:27:59,085 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,086 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 999); {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:27:59,087 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:27:59,087 INFO L273 TraceCheckUtils]: 108: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 110: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,087 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 112: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 114: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 116: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 118: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 120: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,088 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L273 TraceCheckUtils]: 122: Hoare triple {13920#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 1000); {13920#false} is VALID [2018-11-23 12:27:59,089 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:27:59,089 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:27:59,089 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:27:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:27:59,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:59,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:27:59,124 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:27:59,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:59,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:27:59,249 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:59,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:27:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:27:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:27:59,250 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:28:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,241 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:28:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:28:00,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:28:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:28:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:28:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:28:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:28:00,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:28:00,339 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:00,341 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:28:00,341 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:28:00,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:28:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:28:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:28:00,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:00,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:00,388 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:00,388 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:28:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,390 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:28:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:28:00,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:00,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:00,391 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:28:00,391 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:28:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:00,393 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:28:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:28:00,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:00,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:00,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:00,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:28:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:28:00,396 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:28:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:00,396 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:28:00,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:28:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:28:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:28:00,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:00,398 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:00,398 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:00,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:28:00,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:00,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:00,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:00,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:00,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:01,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:28:01,337 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:01,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:01,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:28:01,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:28:01,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:28:01,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:28:01,341 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:01,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:01,342 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:01,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:01,343 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:01,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:01,344 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:01,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:01,344 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:01,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:01,345 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:01,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:01,347 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:01,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:01,348 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:01,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:01,349 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:01,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:01,350 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:01,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:01,351 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:01,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:01,353 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:01,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:01,354 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:01,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:01,355 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:01,356 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:01,356 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:01,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:01,358 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:01,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:01,359 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:01,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:01,360 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:01,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:01,361 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:01,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:01,362 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:01,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:01,363 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:01,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:01,365 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:01,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:01,366 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:01,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 1000); {14873#false} is VALID [2018-11-23 12:28:01,367 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:01,367 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:01,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,367 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:01,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,368 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:01,368 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,368 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:01,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,368 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:01,368 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,369 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:01,369 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,369 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:01,369 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,369 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:01,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:28:01,370 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:01,370 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:01,370 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:28:01,370 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:01,370 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:01,371 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:01,371 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,371 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:01,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,371 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:01,371 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,371 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:01,371 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,372 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:01,372 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,372 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:01,372 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,372 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:01,372 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,372 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:01,372 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:28:01,372 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:01,372 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:01,373 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:28:01,373 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:01,373 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,373 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:01,373 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,373 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:01,373 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,373 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:01,373 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,374 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:01,374 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,374 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:01,374 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:01,374 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:01,374 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:28:01,374 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:28:01,374 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:01,374 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:01,375 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,375 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:01,375 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,375 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:01,375 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,375 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:01,375 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,375 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:01,375 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,375 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:01,376 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,376 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:01,376 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14872#true} is VALID [2018-11-23 12:28:01,376 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:01,376 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 1000); {14872#true} is VALID [2018-11-23 12:28:01,376 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:01,376 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:01,376 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:28:01,376 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:01,377 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:01,377 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:28:01,385 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:01,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:01,385 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:01,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:03,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:28:03,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:03,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:04,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:28:04,731 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:04,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:28:04,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:28:04,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret12 := main(); {14872#true} is VALID [2018-11-23 12:28:04,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:28:04,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,732 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:04,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,733 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:04,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,733 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:04,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,733 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:04,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,734 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:04,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,734 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:04,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,734 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:04,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,734 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:04,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,734 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:04,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,735 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:04,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,735 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:04,735 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,735 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:04,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,735 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:04,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,735 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:04,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,736 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:04,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,736 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:04,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,736 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:04,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,736 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:04,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,737 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:04,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,737 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:04,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,737 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:04,737 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,737 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:04,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {14872#true} is VALID [2018-11-23 12:28:04,737 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:04,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 1000); {14872#true} is VALID [2018-11-23 12:28:04,738 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:04,738 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:04,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15063#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:04,739 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:04,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15070#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:04,740 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:04,740 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15077#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:04,741 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:04,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15084#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:04,742 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:04,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15091#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:04,743 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:04,744 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15098#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:04,744 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:04,745 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= mapsum_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15105#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:04,746 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:04,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= mapsum_~i~0 7)} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:28:04,747 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:04,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:04,747 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:28:04,747 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:04,747 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:04,748 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:04,748 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,748 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:04,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,748 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:04,748 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,749 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:04,749 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,749 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:04,749 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,749 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:04,750 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,750 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:04,750 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,750 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:04,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:28:04,750 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:04,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:04,751 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:28:04,751 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:04,751 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,751 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:04,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,751 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:04,751 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,751 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:04,751 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,752 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:04,752 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,752 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:04,752 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14873#false} is VALID [2018-11-23 12:28:04,752 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:04,752 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 999); {14873#false} is VALID [2018-11-23 12:28:04,752 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:28:04,752 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:04,752 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:04,752 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,753 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:04,753 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,753 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:04,753 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,753 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:04,753 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,753 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:04,753 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,753 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:04,754 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,754 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:04,754 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {14873#false} is VALID [2018-11-23 12:28:04,754 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:04,754 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 1000); {14873#false} is VALID [2018-11-23 12:28:04,754 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:04,754 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:28:04,754 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:28:04,754 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:04,755 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:04,755 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:28:04,784 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:04,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:28:04,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:28:04,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:04,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:28:04,918 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:04,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:28:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:28:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:04,920 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:28:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,724 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:28:05,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:05,725 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:28:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:28:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:28:05,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:28:05,936 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:05,938 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:28:05,938 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:28:05,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:28:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:28:05,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:05,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,971 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,972 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:28:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,974 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:05,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,975 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:05,975 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:28:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:05,977 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:28:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:28:05,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:05,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:05,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:05,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:28:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:28:05,980 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:28:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:05,980 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:28:05,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:28:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:28:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:28:05,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:05,982 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:05,982 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:05,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:28:05,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:05,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:06,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:28:06,597 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:06,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:06,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:28:06,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:28:06,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:28:06,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:28:06,600 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:06,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:06,601 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:06,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:06,601 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:06,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:06,602 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:06,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:06,603 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:06,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:06,604 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:06,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:06,605 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:06,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:06,640 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:06,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:06,656 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:06,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:06,657 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:06,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:06,657 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:06,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:06,658 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:06,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:06,659 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:06,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:06,660 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:06,660 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:06,661 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:06,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:06,662 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:06,663 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:06,663 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:06,664 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:06,665 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:06,665 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:06,666 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:06,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:06,667 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:06,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:06,668 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:06,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:06,670 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:06,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:06,671 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:06,671 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:06,672 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:06,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 1000); {15863#false} is VALID [2018-11-23 12:28:06,673 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:06,673 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:06,673 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,673 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:06,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,674 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:06,674 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,674 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:06,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,675 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:06,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,675 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:06,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,675 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:06,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,676 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:06,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,676 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:06,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:28:06,676 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:06,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:06,677 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:28:06,677 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:06,677 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:06,677 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:06,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,678 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:06,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,678 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:06,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,678 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:06,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,678 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:06,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,679 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:06,679 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,679 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:06,679 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,679 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:06,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,679 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:06,679 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:28:06,679 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:06,679 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:06,680 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:28:06,680 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:06,680 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,680 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:06,680 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,680 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:06,680 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,680 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:06,680 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,681 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:06,681 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,681 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:06,681 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15863#false} is VALID [2018-11-23 12:28:06,681 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:06,681 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:28:06,681 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:28:06,681 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:06,681 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:06,681 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,682 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:06,682 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,682 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:06,682 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,682 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:06,682 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,682 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:06,682 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,682 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:06,683 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,683 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:06,683 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,683 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:06,683 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:06,683 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:06,683 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:28:06,683 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:06,683 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:06,683 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:28:06,684 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:06,684 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:06,684 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:28:06,693 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:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:06,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:07,650 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:28:07,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:07,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:09,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:28:09,092 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:09,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:09,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:28:09,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret12 := main(); {15862#true} is VALID [2018-11-23 12:28:09,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:28:09,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,093 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:09,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,094 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:09,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,094 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:09,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,094 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:09,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,094 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:09,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,094 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:09,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,095 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:09,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,095 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:09,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,095 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:09,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,095 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:09,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,096 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:09,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,096 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:09,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,096 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:09,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,096 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:09,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,096 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:09,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,097 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:09,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,097 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:09,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,097 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:09,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,097 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:09,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,097 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:09,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,098 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:09,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,098 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:09,098 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,098 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:09,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {15862#true} is VALID [2018-11-23 12:28:09,098 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:09,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 1000); {15862#true} is VALID [2018-11-23 12:28:09,098 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:09,099 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:09,099 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,099 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:09,099 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,099 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:09,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,099 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:09,099 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,099 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:09,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,100 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:09,100 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,100 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:09,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,100 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:09,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,100 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:09,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:28:09,100 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:09,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:09,101 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:28:09,101 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:09,101 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:09,101 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:09,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,101 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:09,101 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,101 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:09,102 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,102 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:09,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,102 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:09,102 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,102 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:09,102 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,102 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:09,102 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,102 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:09,103 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15862#true} is VALID [2018-11-23 12:28:09,103 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:09,103 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 1000); {15862#true} is VALID [2018-11-23 12:28:09,103 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:09,103 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:28:09,103 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:28:09,104 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:09,104 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:09,104 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:09,105 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:09,105 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:09,105 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:09,106 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:09,106 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:09,107 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:09,107 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:09,108 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:09,108 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:09,109 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:09,110 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 999); {15863#false} is VALID [2018-11-23 12:28:09,110 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:28:09,110 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:09,110 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:09,110 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,111 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:09,111 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,111 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:09,111 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,111 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:09,111 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,112 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:09,112 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,112 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:09,112 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,112 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:09,112 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,113 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:09,113 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {15863#false} is VALID [2018-11-23 12:28:09,113 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:09,113 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 1000); {15863#false} is VALID [2018-11-23 12:28:09,113 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:09,113 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:28:09,113 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:28:09,113 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:09,113 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:09,114 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:28:09,121 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:09,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:09,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:28:09,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:28:09,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:09,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:28:09,771 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:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:28:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:28:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:09,772 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:28:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,736 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:28:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:10,736 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:28:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:28:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:28:10,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:28:10,860 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:10,862 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:28:10,862 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:28:10,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:28:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:28:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:28:10,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:10,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:10,937 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:10,937 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:28:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,940 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:10,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,941 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:10,941 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:28:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:10,943 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:28:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:10,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:10,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:10,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:10,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:28:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:28:10,945 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:28:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:10,945 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:28:10,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:28:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:28:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:28:10,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:10,946 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:10,946 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:28:10,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:11,544 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:11,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:11,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:11,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:11,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:28:11,546 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:11,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,546 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:11,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,547 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:11,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,548 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:11,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,549 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:11,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,550 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:11,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,552 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:11,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,553 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:11,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,554 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:11,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,555 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:11,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,557 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:11,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,558 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:11,558 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,559 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:11,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,560 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:11,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,561 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:11,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,563 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:11,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,564 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:11,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:11,565 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:11,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:11,566 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:11,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:11,568 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:11,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:11,569 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:11,569 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:11,570 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:11,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:11,571 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:11,572 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:11,573 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:11,573 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:11,574 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:11,575 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 1000); {16900#false} is VALID [2018-11-23 12:28:11,575 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:11,575 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:11,575 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,575 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:11,576 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,576 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:11,576 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,576 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:11,576 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,577 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:11,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,577 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:11,577 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,577 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:11,577 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,577 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:11,577 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,578 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:11,578 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:28:11,578 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:11,578 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:11,578 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:11,578 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:11,578 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:11,578 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:11,578 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,579 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:11,579 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,579 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:11,580 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,580 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:11,580 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,580 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:11,580 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,580 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:11,580 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:28:11,580 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:11,580 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:11,580 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:11,581 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:11,581 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,581 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:11,581 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,581 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:11,581 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,581 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:11,581 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,581 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:11,582 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,582 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:11,582 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,582 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:11,582 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,582 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:11,582 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 999); {16900#false} is VALID [2018-11-23 12:28:11,582 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:11,582 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:11,582 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:11,583 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,583 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:11,583 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 1000);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:11,584 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:11,584 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 1000); {16899#true} is VALID [2018-11-23 12:28:11,584 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:11,584 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:11,585 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:11,585 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:11,585 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:11,585 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:11,594 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:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:11,595 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:11,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:11,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:11,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:28:11,941 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:11,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:28:11,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:28:11,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret12 := main(); {16899#true} is VALID [2018-11-23 12:28:11,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:11,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:11,943 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:11,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:11,944 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:11,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:11,945 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:11,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:11,946 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:11,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:11,947 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:11,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:11,948 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:11,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:11,949 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:11,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:11,951 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:11,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:11,952 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:11,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:11,953 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:11,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:11,954 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:11,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:11,956 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:11,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:11,957 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:11,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:11,958 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:11,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:11,959 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:11,960 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:11,961 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:11,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:11,962 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:11,962 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:11,963 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:11,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:11,964 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:11,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:11,966 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:11,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:11,967 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:11,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:11,968 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:11,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:11,969 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:11,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:11,970 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:11,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:11,972 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:11,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 1000); {16900#false} is VALID [2018-11-23 12:28:11,973 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:11,973 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:11,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,973 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:11,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,973 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:11,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,974 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:11,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,974 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:11,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,975 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:11,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,975 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:11,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,975 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:11,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,976 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:11,976 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:28:11,976 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:11,976 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:11,976 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:28:11,976 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:11,976 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:11,976 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:11,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,977 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:11,977 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,977 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:11,977 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,977 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:11,977 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,977 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:11,977 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,978 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:11,978 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,978 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:11,978 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,978 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:11,978 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,978 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:11,978 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:28:11,978 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:11,978 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:11,979 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:28:11,979 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:11,979 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,979 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:11,979 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,979 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:11,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,979 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:11,979 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,980 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:11,980 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,980 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:11,980 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,980 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:11,980 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:11,980 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:11,980 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 999); {16900#false} is VALID [2018-11-23 12:28:11,980 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:28:11,980 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:11,981 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:11,981 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,981 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:11,981 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,981 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:11,981 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,981 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:11,981 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,981 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:11,982 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,982 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:11,982 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,982 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:11,982 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,982 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:11,982 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 1000);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:11,982 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:11,982 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 1000); {16900#false} is VALID [2018-11-23 12:28:11,982 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:11,983 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:28:11,983 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:28:11,983 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:11,983 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:11,983 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:28:11,993 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:12,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:12,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:28:12,013 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:12,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:12,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:28:12,102 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:12,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:28:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:28:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:12,104 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:28:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,838 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:28:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:28:12,838 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:28:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:28:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:28:12,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:28:12,939 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:12,942 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:28:12,942 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:28:12,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:28:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:28:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:28:12,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:12,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:12,989 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:12,989 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:28:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,991 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:12,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:12,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:12,993 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:12,993 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:28:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:12,995 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:28:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:28:12,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:12,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:12,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:12,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:28:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:28:12,998 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:28:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:12,999 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:28:12,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:28:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:28:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:28:13,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:13,000 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:13,001 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:13,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:28:13,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:13,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:14,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:14,376 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:14,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:14,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:14,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:14,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:14,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:28:14,378 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:14,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:14,379 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:14,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:14,380 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:14,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:14,381 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:14,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:14,382 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:14,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:14,383 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:14,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:14,384 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:14,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:14,385 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:14,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:14,386 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:14,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:14,388 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:14,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:14,389 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:14,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:14,390 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:14,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:14,391 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:14,392 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:14,392 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:14,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:14,393 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:14,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:14,395 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:14,395 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:14,396 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:14,396 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:14,397 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:14,397 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:14,398 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:14,399 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:14,399 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:14,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:14,400 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:14,401 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:14,402 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:14,402 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:14,403 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:14,403 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:14,404 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:14,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:14,405 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:14,406 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:14,407 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:14,407 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 1000); {17954#false} is VALID [2018-11-23 12:28:14,407 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:14,408 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:14,408 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,408 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:14,408 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,408 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:14,409 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,409 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:14,409 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,409 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:14,409 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,409 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:14,410 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,410 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:14,410 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,410 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:14,410 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,410 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:14,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:28:14,410 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:14,410 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:14,410 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:14,411 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:14,411 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:14,411 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:14,411 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,411 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:14,411 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,411 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:14,411 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,411 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:14,412 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,412 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:14,412 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,412 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:14,412 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,412 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:14,412 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,412 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:14,412 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,413 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:14,413 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:28:14,413 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:14,413 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:14,413 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:14,413 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:14,413 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,413 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:14,413 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,413 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:14,414 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,414 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:14,414 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,414 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:14,414 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,414 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:14,414 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,414 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:14,414 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,415 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:14,415 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 999); {17954#false} is VALID [2018-11-23 12:28:14,415 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:14,415 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:14,415 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:14,415 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,415 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:14,415 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,415 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:14,415 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,416 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:14,416 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,416 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:14,416 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,416 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:14,416 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,416 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:14,416 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,416 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:14,417 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 1000);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:14,417 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:14,417 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 1000); {17953#true} is VALID [2018-11-23 12:28:14,417 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:14,417 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:14,417 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:14,417 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:14,417 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:14,417 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:14,427 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:14,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:14,427 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:14,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:14,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:14,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:14,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:14,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:28:14,829 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:14,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:28:14,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:28:14,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret12 := main(); {17953#true} is VALID [2018-11-23 12:28:14,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:14,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:14,831 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:14,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:14,832 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:14,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:14,832 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:14,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:14,834 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:14,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:14,835 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:14,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:14,836 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:14,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:14,837 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:14,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:14,838 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:14,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:14,840 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:14,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:14,841 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:14,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:14,842 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:14,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:14,843 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:14,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:14,844 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:14,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:14,846 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:14,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:14,847 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:14,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:14,848 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:14,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:14,849 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:14,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:14,850 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:14,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:14,851 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:14,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:14,853 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:14,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:14,854 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:14,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:14,855 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:14,855 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:14,856 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:14,857 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:14,857 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:14,858 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:14,859 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:14,859 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:14,860 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:14,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 1000); {17954#false} is VALID [2018-11-23 12:28:14,861 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:14,861 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:14,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,861 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:14,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,862 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:14,862 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,862 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:14,862 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,862 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:14,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,863 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:14,863 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,863 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:14,863 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,863 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:14,863 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,863 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:14,863 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:28:14,863 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:14,863 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:14,864 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:28:14,864 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:14,864 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:14,864 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:14,864 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,864 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:14,864 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,864 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:14,864 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,865 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:14,865 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,865 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:14,865 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,865 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:14,865 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,865 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:14,865 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,865 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:14,865 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,866 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:14,866 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:28:14,866 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:14,866 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:14,866 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:28:14,866 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:14,866 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,866 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:14,866 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,866 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:14,867 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,867 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:14,867 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,867 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:14,867 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,867 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:14,867 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,867 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:14,867 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:14,868 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:14,868 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 999); {17954#false} is VALID [2018-11-23 12:28:14,868 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:28:14,868 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:14,868 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:14,868 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,868 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:14,868 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,868 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:14,868 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,869 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:14,869 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,869 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:14,869 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,869 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:14,869 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,869 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:14,869 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,869 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:14,870 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 1000);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:14,870 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:14,870 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 1000); {17954#false} is VALID [2018-11-23 12:28:14,870 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:14,870 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:28:14,870 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:28:14,870 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:14,870 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:14,870 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:28:14,880 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:14,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:14,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:28:14,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:14,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:14,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:28:14,990 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:14,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:28:14,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:28:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:14,992 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:28:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:15,760 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:28:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:28:15,761 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:28:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:28:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:28:15,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:28:15,898 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:15,900 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:28:15,900 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:28:15,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:28:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:28:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:28:15,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:15,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:15,944 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:28:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:15,946 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:15,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:15,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:15,947 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:15,947 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:28:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:15,949 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:28:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:28:15,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:15,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:15,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:15,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:28:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:28:15,952 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:28:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:15,952 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:28:15,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:28:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:28:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:28:15,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:15,953 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:15,953 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:15,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:28:15,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:15,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:15,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:17,379 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:17,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:17,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:17,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:28:17,381 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:17,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:17,382 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:17,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:17,383 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:17,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:17,383 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:17,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:17,385 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:17,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:17,386 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:17,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:17,387 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:17,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:17,388 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:17,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:17,389 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:17,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:17,390 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:17,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:17,392 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:17,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:17,393 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:17,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:17,394 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:17,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:17,395 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:17,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:17,396 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:17,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:17,397 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:17,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:17,399 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:17,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:17,400 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:17,400 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:17,401 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:17,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:17,402 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:17,403 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:17,403 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:17,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:17,405 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:17,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:17,406 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:17,406 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:17,407 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:17,407 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:17,408 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:17,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:17,409 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:17,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:17,410 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:17,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 1000); {19025#false} is VALID [2018-11-23 12:28:17,411 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:17,411 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:17,412 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,412 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:17,412 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,412 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:17,412 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,412 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:17,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,413 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:17,413 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,413 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:17,413 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,413 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:17,413 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,414 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:17,414 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,414 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:17,414 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,414 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:17,414 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,414 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:28:17,414 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:17,414 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:17,415 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:17,415 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,415 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:17,415 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,415 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:17,415 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,415 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:17,415 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,415 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:17,415 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,416 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:17,416 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,416 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:17,416 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,416 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:17,416 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,416 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:17,416 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,416 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:17,417 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,417 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:28:17,417 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:17,417 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,417 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:17,417 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,417 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:17,417 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,417 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:17,417 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,418 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:17,418 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,418 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:17,418 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,418 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:17,418 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:17,418 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:17,418 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 999); {19025#false} is VALID [2018-11-23 12:28:17,418 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:17,419 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:17,419 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:17,419 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,419 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:17,419 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,419 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:17,419 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,419 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:17,419 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,419 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:17,420 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,420 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:17,420 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,420 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:17,420 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,420 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:17,420 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,420 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:17,420 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,420 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:17,421 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,421 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:17,421 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:17,421 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:17,421 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:17,431 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:17,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:17,431 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:17,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:17,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:28:17,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:17,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:17,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:28:17,924 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:17,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:28:17,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret12 := main(); {19024#true} is VALID [2018-11-23 12:28:17,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19024#true} is VALID [2018-11-23 12:28:17,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,925 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:17,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,925 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:17,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,926 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:17,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,926 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:17,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,926 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:17,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,926 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:17,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,927 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:17,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,927 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:17,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,927 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:17,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,927 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:17,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,927 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:17,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,928 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:17,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,928 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:17,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,928 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:17,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,928 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:17,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,928 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:17,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,929 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:17,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,929 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:17,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,929 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:17,929 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,929 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:17,929 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,929 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:17,930 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,930 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:17,930 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,930 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:17,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,930 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:17,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,930 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:17,930 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,930 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:17,931 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 1000);assume -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:17,931 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:17,931 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,931 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:17,931 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:17,931 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,931 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:17,931 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,931 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:17,932 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,932 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:17,932 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,932 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:17,932 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,932 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:17,932 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,932 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:17,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,932 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:17,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,933 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:17,933 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,933 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:17,933 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,933 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:28:17,933 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:17,933 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:17,933 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:17,934 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,934 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:17,934 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,934 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:17,934 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,934 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:17,934 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,934 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:17,934 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,934 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:17,935 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,935 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:17,935 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,935 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:17,935 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 1000);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:17,935 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:17,935 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 1000); {19024#true} is VALID [2018-11-23 12:28:17,935 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:17,935 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:28:17,936 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:28:17,936 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:17,936 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:17,937 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:17,937 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:17,938 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:17,938 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:17,938 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:17,939 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:17,939 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:17,939 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:17,940 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:17,940 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:17,941 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:17,941 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:17,942 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:17,943 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 999); {19025#false} is VALID [2018-11-23 12:28:17,943 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:28:17,943 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:17,943 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:17,944 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,944 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:17,944 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,944 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:17,944 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,944 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:17,945 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,945 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:17,945 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,946 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:17,946 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,946 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:17,946 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,946 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:17,947 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 1000);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:17,947 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:17,947 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 1000); {19025#false} is VALID [2018-11-23 12:28:17,947 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:17,947 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:28:17,947 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:28:17,948 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:17,948 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:17,948 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:28:17,959 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:17,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:28:17,981 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:17,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:17,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:28:18,329 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:18,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:28:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:28:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:18,331 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:28:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,484 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:28:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:28:19,484 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:28:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:28:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:28:19,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:28:19,608 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:19,611 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:28:19,611 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:28:19,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:28:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:28:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:28:19,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:19,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:19,774 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:19,774 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:28:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,776 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:19,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,776 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:19,777 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:28:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:19,779 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:28:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:28:19,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:19,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:19,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:19,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:28:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:28:19,782 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:28:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:19,782 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:28:19,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:28:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:28:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:28:19,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:19,783 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:19,784 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:19,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:28:19,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:19,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:19,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:20,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:20,352 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:20,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:20,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:20,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:20,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:28:20,355 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:20,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:20,356 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:20,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:20,358 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:20,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:20,359 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:20,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:20,360 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:20,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:20,361 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:20,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:20,363 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:20,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:20,364 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:20,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:20,365 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:20,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:20,366 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:20,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:20,367 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:20,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:20,369 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:20,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:20,370 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:20,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:20,371 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:20,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:20,372 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:20,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:20,373 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:20,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:20,375 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:20,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:20,376 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:20,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:20,377 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:20,377 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:20,378 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:20,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:20,379 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:20,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:20,380 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:20,381 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:20,382 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:20,382 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:20,383 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:20,383 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:20,384 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:20,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:20,385 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:20,386 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:20,386 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:20,387 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:20,388 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:20,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 1000); {20133#false} is VALID [2018-11-23 12:28:20,389 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:20,389 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:20,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,389 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:20,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,389 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:20,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,390 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:20,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,390 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:20,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,390 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:20,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,391 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:20,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,391 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:20,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,392 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:20,392 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,392 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:20,392 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,392 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:28:20,393 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:20,393 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:20,393 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:20,393 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,393 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:20,393 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,394 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:20,394 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,394 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:20,394 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,394 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:20,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,394 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:20,394 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,395 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:20,395 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,395 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:20,395 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,395 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:20,395 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,395 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:20,395 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,395 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:28:20,395 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:20,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,396 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:20,396 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,396 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:20,396 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,396 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:20,396 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,396 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:20,396 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,397 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:20,397 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,397 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:20,397 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,397 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:20,397 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,397 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:20,397 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 999); {20133#false} is VALID [2018-11-23 12:28:20,397 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:28:20,397 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:20,398 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:20,398 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,398 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:20,398 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,398 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:20,398 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,398 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:20,398 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,398 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:20,399 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,399 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:20,399 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,399 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:20,399 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,399 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:20,399 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,399 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:20,399 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,399 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:20,400 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,400 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:28:20,400 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:20,400 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:20,400 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:20,411 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:20,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:20,411 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:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:20,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:20,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:20,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:20,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:28:20,821 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:20,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:28:20,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret12 := main(); {20132#true} is VALID [2018-11-23 12:28:20,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20132#true} is VALID [2018-11-23 12:28:20,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,822 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:20,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,823 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:20,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,823 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:20,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,823 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:20,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,824 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:20,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,824 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:20,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,824 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:20,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,824 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:20,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,825 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:20,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,825 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:20,825 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,825 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:20,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,825 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:20,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,825 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:20,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,826 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:20,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,826 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:20,826 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,826 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:20,826 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,826 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:20,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,826 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:20,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,827 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:20,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,827 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:20,827 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,827 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:20,827 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,827 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:20,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,827 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:20,828 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,828 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:20,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,828 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:20,828 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,828 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:20,828 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,828 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:20,828 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 1000);assume -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:20,829 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:20,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,829 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:20,829 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:20,829 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,829 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:20,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,829 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:20,829 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,829 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:20,830 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,830 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:20,830 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,830 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:20,830 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,830 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:20,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,830 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:20,830 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,831 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:20,831 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,831 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:20,831 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,831 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:28:20,831 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:20,831 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:20,831 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:20,832 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,832 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:20,832 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,832 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:20,832 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,832 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:20,833 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,833 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:20,833 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,833 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:20,833 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,833 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:20,834 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,834 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:20,834 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 1000);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:20,834 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:20,834 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 1000); {20132#true} is VALID [2018-11-23 12:28:20,834 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:20,834 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:28:20,835 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:28:20,835 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:20,835 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,835 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:20,835 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,835 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:20,836 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,836 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:20,836 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,836 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:20,836 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,836 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:20,837 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,837 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:20,837 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,837 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:20,837 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {20132#true} is VALID [2018-11-23 12:28:20,837 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:20,838 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 999); {20132#true} is VALID [2018-11-23 12:28:20,838 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:28:20,838 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:20,859 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:20,872 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20550#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:20,881 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:20,895 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20557#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:20,898 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:20,899 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20564#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:20,899 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:20,901 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20571#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:20,901 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:20,903 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20578#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:20,903 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:20,906 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20585#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:20,906 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:20,908 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= mapsum_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20592#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:20,908 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:20,908 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= mapsum_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {20599#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:20,909 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:20,909 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= mapsum_~i~0 8)} assume !(~i~0 < 1000); {20133#false} is VALID [2018-11-23 12:28:20,909 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:20,909 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:28:20,910 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:28:20,910 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:20,910 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:20,910 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:28:20,942 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:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:28:20,964 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:20,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:20,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:28:21,076 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:21,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:28:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:28:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:28:21,078 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:28:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,591 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:28:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:21,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:28:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:28:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:28:21,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:28:21,716 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:21,718 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:28:21,718 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:28:21,719 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:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:28:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:28:21,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:21,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:21,761 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:21,761 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:28:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,763 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:21,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,763 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:21,764 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:28:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:21,765 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:28:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:28:21,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:21,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:21,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:21,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:28:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:28:21,767 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:28:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:21,767 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:28:21,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:28:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:28:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:28:21,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:21,768 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:21,769 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:21,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:28:21,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:22,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:22,505 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:22,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:22,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:22,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:22,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:22,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:28:22,507 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:22,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:22,508 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:22,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:22,509 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:22,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:22,510 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:22,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:22,512 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:22,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:22,513 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:22,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:22,514 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:22,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:22,515 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:22,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:22,516 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:22,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:22,518 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:22,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:22,519 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:22,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:22,520 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:22,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:22,521 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:22,522 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:22,523 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:22,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:22,524 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:22,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:22,525 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:22,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:22,526 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:22,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:22,528 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:22,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:22,529 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:22,529 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:22,530 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:22,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:22,531 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:22,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:22,533 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:22,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:22,534 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:22,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:22,535 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:22,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:22,536 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:22,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:22,538 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:22,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:22,539 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:22,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:22,540 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:22,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:22,541 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:22,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 1000); {21278#false} is VALID [2018-11-23 12:28:22,542 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:22,542 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:22,543 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,543 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:22,543 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,543 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:22,543 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,543 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:22,544 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,544 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:22,544 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,544 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:22,544 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,544 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:22,545 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,545 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:22,545 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,545 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:22,545 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,545 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:22,546 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:28:22,546 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:22,546 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:22,546 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:28:22,546 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:22,546 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:22,547 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:22,547 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,547 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:22,547 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,547 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:22,547 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,547 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:22,547 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,548 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:22,548 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,548 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:22,548 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,548 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:22,548 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,548 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:22,548 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,548 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:22,548 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,549 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:22,549 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:28:22,549 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:22,549 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:22,549 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:22,549 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:22,549 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,549 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:22,549 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,550 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:22,550 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,550 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:22,550 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,550 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:22,550 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,550 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:22,550 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,550 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:22,550 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,551 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:22,551 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:22,551 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:22,551 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 999); {21278#false} is VALID [2018-11-23 12:28:22,551 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:22,551 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:22,551 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:22,551 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,551 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:22,552 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,552 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:22,552 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,552 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:22,552 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,552 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:22,552 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,552 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:22,552 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,552 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:22,553 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,553 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:22,553 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,553 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:22,553 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 1000);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:22,553 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:22,553 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 1000); {21277#true} is VALID [2018-11-23 12:28:22,553 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:22,553 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:22,553 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:22,554 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:22,554 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:22,554 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:22,565 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:22,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:22,566 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:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:37,380 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:28:37,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:37,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:37,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:28:37,765 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:37,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:28:37,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:28:37,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret12 := main(); {21277#true} is VALID [2018-11-23 12:28:37,766 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21277#true} is VALID [2018-11-23 12:28:37,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,766 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:37,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,767 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:37,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,767 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:37,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,767 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:37,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,768 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:37,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,768 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:37,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,768 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:37,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,768 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:37,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,768 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:37,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,769 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:37,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,769 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:37,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,769 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:37,769 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,769 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:37,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,770 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:37,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,770 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:37,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,770 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:37,770 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,770 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:37,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,770 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:37,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,771 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:37,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,771 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:37,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,771 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:37,771 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,771 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:37,771 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,771 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:37,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,772 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:37,772 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,772 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:37,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,772 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:37,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,772 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:37,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,772 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:37,773 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 1000);assume -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:37,773 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:37,773 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 1000); {21277#true} is VALID [2018-11-23 12:28:37,773 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:37,773 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:37,774 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21510#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:28:37,774 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:37,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21517#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:28:37,775 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:37,775 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21524#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:28:37,776 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:37,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21531#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:28:37,777 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:37,778 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21538#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:28:37,778 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:37,779 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21545#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:28:37,779 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:37,780 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= mapsum_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21552#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:28:37,781 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:37,781 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= mapsum_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21559#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:28:37,783 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:37,783 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= mapsum_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {21566#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:28:37,784 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:37,785 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= mapsum_~i~0 9)} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:28:37,785 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:37,785 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:37,786 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:28:37,786 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:37,786 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:37,786 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:37,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,787 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:37,787 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,787 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:37,787 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,788 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:37,788 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,788 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:37,788 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,788 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:37,788 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,789 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:37,789 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,789 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:37,789 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,789 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:37,790 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,790 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:37,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:28:37,790 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:37,790 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:37,790 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:28:37,790 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:37,790 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,790 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:37,791 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,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:37,791 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,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:37,791 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,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:37,791 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,791 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:37,791 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,791 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:37,792 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,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:37,792 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:37,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:37,792 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 999); {21278#false} is VALID [2018-11-23 12:28:37,792 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:28:37,792 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:37,792 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:37,792 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,792 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:37,793 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,793 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:37,793 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,793 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:37,793 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,793 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:37,793 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,793 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:37,793 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,794 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:37,794 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,794 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:37,794 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,794 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:37,794 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 1000);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:37,794 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:37,794 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 1000); {21278#false} is VALID [2018-11-23 12:28:37,794 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:37,794 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:28:37,795 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:28:37,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:37,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:37,795 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:28:37,805 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:37,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:28:37,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:37,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:37,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:37,948 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:37,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:37,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:37,950 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:28:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,918 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:28:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:38,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:28:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:28:38,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:28:39,047 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:39,050 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:28:39,050 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:28:39,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:28:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:28:39,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:39,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:39,096 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:39,096 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:28:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,099 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:39,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,100 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:39,100 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:28:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,102 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:28:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:28:39,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:39,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:28:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:28:39,105 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:28:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:39,105 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:28:39,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:28:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:28:39,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:39,107 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:39,107 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:28:39,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:40,258 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:40,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:40,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:40,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:40,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,260 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:40,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,261 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:40,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,261 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:40,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,263 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:40,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,264 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:40,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,265 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:40,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,266 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:40,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,267 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:40,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,269 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:40,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,270 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:40,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,271 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:40,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,272 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:40,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,274 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:40,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,275 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:40,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,276 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:40,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,277 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:40,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,279 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:40,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,280 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:40,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,281 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:40,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,283 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:40,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,284 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:40,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,285 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:40,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,286 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:40,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,288 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:40,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,289 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:40,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,290 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:40,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,291 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:40,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,293 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:40,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,294 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:40,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,295 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:40,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 1000); {22472#false} is VALID [2018-11-23 12:28:40,296 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:40,296 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:40,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,297 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:40,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,297 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:40,297 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,297 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:40,298 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,298 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:40,298 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,298 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:40,298 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,298 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:40,299 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,299 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:40,299 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,299 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:40,299 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,299 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:40,299 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,299 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:40,299 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:28:40,300 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:40,300 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:40,300 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:28:40,300 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:40,300 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:40,300 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:40,300 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,300 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:40,300 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,300 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:40,301 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,301 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:40,301 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,301 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:40,301 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,301 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:40,301 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,301 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:40,301 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,302 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:40,302 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,302 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:40,302 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,302 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:40,302 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,302 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:40,302 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:28:40,302 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:40,302 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:40,303 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:28:40,303 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:40,303 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,303 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:40,303 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,303 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:40,303 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,303 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:40,303 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,304 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:40,304 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,304 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:40,304 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,304 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:40,304 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,304 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:40,304 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:40,304 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:40,304 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 999); {22472#false} is VALID [2018-11-23 12:28:40,305 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:40,305 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:40,305 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:40,305 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,305 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:40,305 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,305 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:40,305 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,305 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:40,305 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,306 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:40,306 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,306 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:40,306 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,306 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:40,306 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,306 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:40,306 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,306 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:40,307 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,307 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:40,307 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:40,307 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:40,307 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:28:40,307 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:40,307 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:40,307 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:40,307 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:40,308 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:40,308 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:40,321 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:40,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:40,321 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:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:45,839 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:28:45,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:45,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:46,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:28:46,441 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:46,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:46,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:28:46,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret12 := main(); {22471#true} is VALID [2018-11-23 12:28:46,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22471#true} is VALID [2018-11-23 12:28:46,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,442 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:46,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,443 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:46,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,443 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:46,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,443 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:46,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,443 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:46,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,444 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:46,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,444 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:46,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,444 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:46,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,444 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:46,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,444 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:46,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,445 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:46,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,445 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:46,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,445 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:46,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,445 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:46,445 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,446 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:46,446 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,446 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:46,446 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,446 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:46,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,446 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:46,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,446 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:46,446 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,447 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:46,447 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,447 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:46,447 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,447 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:46,447 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,447 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:46,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,447 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:46,447 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,448 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:46,448 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,448 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:46,448 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,448 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:46,448 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,448 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:46,448 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,448 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:46,449 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 1000);assume -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:46,449 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:46,449 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 1000); {22471#true} is VALID [2018-11-23 12:28:46,449 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:46,449 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:46,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,449 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:46,449 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,449 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:46,449 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,450 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:46,450 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,450 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:46,450 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,450 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:46,450 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,450 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:46,450 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,450 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:46,450 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,451 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:46,451 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,451 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:46,451 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,451 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:46,451 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:28:46,451 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:46,451 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:46,451 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:28:46,451 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:46,452 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:46,452 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:46,452 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,452 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:46,452 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,452 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:46,452 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,452 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:46,452 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,452 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:46,453 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,453 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:46,453 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,453 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:46,453 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,453 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:46,453 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,453 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:46,453 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,453 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:46,454 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 1000);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:46,454 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:46,454 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 1000); {22471#true} is VALID [2018-11-23 12:28:46,454 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:46,454 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:28:46,454 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:28:46,455 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:46,455 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:46,455 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:46,456 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:46,456 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:46,456 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:46,457 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:46,457 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:46,458 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:46,458 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:46,459 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:46,460 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:46,460 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:46,461 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:46,461 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:46,462 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:46,463 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:46,463 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 999); {22472#false} is VALID [2018-11-23 12:28:46,463 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:28:46,464 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:46,464 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:46,464 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,464 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:46,464 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,464 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:46,465 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,465 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:46,465 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,465 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:46,465 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,465 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:46,466 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,466 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:46,466 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,466 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:46,466 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,466 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:46,467 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,467 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:46,467 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 1000);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:46,467 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:46,467 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 1000); {22472#false} is VALID [2018-11-23 12:28:46,467 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:46,467 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:28:46,467 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:28:46,468 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:46,468 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:46,468 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:28:46,479 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:46,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:46,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:28:46,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:46,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:46,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:46,625 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:46,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:46,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:46,627 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:28:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,736 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:28:47,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:28:47,736 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:28:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:28:47,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:28:47,894 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:47,896 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:28:47,896 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:28:47,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:28:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:28:47,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:47,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:47,941 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:47,941 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:28:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,944 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:47,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:47,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:47,945 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:47,945 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:28:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:47,947 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:28:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:47,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:47,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:47,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:47,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:28:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:28:47,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:28:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:47,950 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:28:47,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:28:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:28:47,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:47,952 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:47,952 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:47,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:28:47,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:47,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:47,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:47,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:49,121 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:49,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:49,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:49,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:49,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:49,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:28:49,124 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:49,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:49,125 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:49,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:49,125 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:49,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:49,126 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:49,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:49,127 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:49,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:49,129 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:49,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:49,130 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:49,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:49,131 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:49,132 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:49,132 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:49,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:49,134 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:49,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:49,135 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:49,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:49,136 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:49,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:49,138 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:49,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:49,139 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:49,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:49,140 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:49,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:49,141 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:49,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:49,142 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:49,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:49,144 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:49,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:49,145 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:49,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:49,146 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:49,147 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:49,147 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:49,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:49,149 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:49,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:49,159 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:49,159 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:49,160 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:49,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:49,161 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:49,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:49,161 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:49,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:49,162 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:49,163 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:49,163 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:49,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:49,165 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:49,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:49,166 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:49,166 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:49,167 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:49,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 1000); {23713#false} is VALID [2018-11-23 12:28:49,168 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:49,168 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:49,168 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,168 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:49,169 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,169 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:49,169 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,169 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:49,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,170 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:49,170 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,170 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:49,170 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,170 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:49,170 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,171 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:49,171 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,171 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:49,171 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,171 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:49,171 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,172 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:49,172 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:28:49,172 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:49,172 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:49,172 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:49,172 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:49,173 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:49,173 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:49,173 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,173 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:49,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,173 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:49,173 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,173 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:49,173 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,173 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:49,174 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,174 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:49,174 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,174 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:49,174 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,174 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:49,174 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,174 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:49,174 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,174 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:49,175 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,175 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:49,175 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:28:49,175 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:49,175 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:49,175 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:49,175 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:49,175 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,175 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:49,175 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,176 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:49,176 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,176 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:49,176 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,176 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:49,176 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,176 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:49,176 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,176 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:49,177 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,177 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:49,177 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,177 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:49,177 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,177 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:49,177 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 999); {23713#false} is VALID [2018-11-23 12:28:49,177 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:49,177 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:49,177 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:49,178 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,178 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:49,178 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,178 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:49,178 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,178 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:49,178 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,178 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:49,178 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,179 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:49,179 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,179 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:49,179 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,179 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:49,179 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,179 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:49,179 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,179 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:49,179 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 1000);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:49,180 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:49,180 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 1000); {23712#true} is VALID [2018-11-23 12:28:49,180 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:49,180 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:49,180 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:49,180 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:49,180 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:49,180 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:49,194 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:49,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:49,194 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:49,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:49,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:49,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:28:49,632 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:49,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:28:49,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:28:49,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret12 := main(); {23712#true} is VALID [2018-11-23 12:28:49,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:49,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:49,636 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:49,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:49,638 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:49,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:49,644 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:49,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:49,647 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:49,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:49,649 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:49,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:49,651 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:49,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:49,653 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:49,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:49,655 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:49,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:49,657 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:49,659 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:49,659 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:49,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:49,661 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:49,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:49,665 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:49,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:49,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:49,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:49,669 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:49,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:49,672 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:49,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:49,674 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:49,674 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:49,676 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:49,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:49,679 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:49,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:49,681 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:49,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:49,684 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:49,684 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:49,687 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:49,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:49,690 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:49,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:49,693 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:49,693 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:49,695 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:49,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:49,697 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:49,697 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:49,700 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:49,700 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:49,703 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:49,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:49,705 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:49,705 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:49,707 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:49,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:49,709 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:49,709 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:49,712 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:49,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 1000); {23713#false} is VALID [2018-11-23 12:28:49,712 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:49,712 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:49,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,712 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:49,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,713 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:49,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,713 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:49,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,713 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:49,713 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,713 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:49,713 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,713 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:49,714 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,714 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:49,714 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,714 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:49,714 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,714 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:49,714 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,714 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:49,714 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:28:49,715 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:49,715 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:49,715 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:28:49,715 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:49,715 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:49,715 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:49,715 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,715 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:49,715 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,715 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:49,716 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,716 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:49,716 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,716 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:49,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,716 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:49,716 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,716 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:49,716 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,716 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:49,717 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,717 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:49,717 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,717 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:49,717 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,717 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:49,717 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:28:49,717 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:49,717 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:49,717 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:28:49,718 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:49,718 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,718 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:49,718 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,718 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:49,718 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,718 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:49,718 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,718 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:49,718 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,719 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:49,719 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,719 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:49,719 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,719 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:49,719 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,720 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:49,720 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:49,720 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:49,720 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 999); {23713#false} is VALID [2018-11-23 12:28:49,720 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:28:49,720 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:49,720 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:49,721 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,721 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:49,721 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,721 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:49,721 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,721 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:49,722 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,722 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:49,722 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,722 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:49,722 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,722 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:49,723 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,723 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:49,723 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,723 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:49,723 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,723 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:49,723 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 1000);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:49,724 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:49,724 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 1000); {23713#false} is VALID [2018-11-23 12:28:49,724 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:49,724 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:28:49,724 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:28:49,724 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:49,724 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:49,725 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:28:49,743 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:49,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:49,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:28:49,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:49,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:49,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:28:49,907 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:49,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:28:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:28:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:49,908 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:28:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,278 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:28:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:28:50,278 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:28:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:28:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:28:50,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:28:50,428 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:50,430 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:28:50,430 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:28:50,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:28:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:28:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:28:50,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:50,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:50,476 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:50,477 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:28:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,479 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:50,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,479 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:50,479 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:28:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,481 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:28:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:28:50,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:50,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:28:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:28:50,483 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:28:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:50,483 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:28:50,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:28:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:28:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:28:50,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:50,484 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:50,484 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:50,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:28:50,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:50,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:51,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:51,155 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:51,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:51,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:51,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:51,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:51,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:28:51,157 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:51,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:51,158 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:51,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:51,159 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:51,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:51,159 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:51,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:51,160 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:51,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:51,161 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:51,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:51,162 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:51,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:51,164 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:51,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:51,165 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:51,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:51,166 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:51,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:51,167 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:51,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:51,168 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:51,169 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:51,169 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:51,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:51,171 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:51,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:51,172 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:51,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:51,173 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:51,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:51,174 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:51,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:51,175 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:51,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:51,176 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:51,177 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:51,177 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:51,178 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:51,179 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:51,179 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:51,180 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:51,180 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:51,181 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:51,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:51,182 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:51,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:51,183 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:51,184 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:51,184 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:51,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:51,185 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:51,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:51,187 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:51,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:51,188 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:51,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:51,189 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:51,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:51,190 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:51,191 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:51,191 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:51,192 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 1000); {24969#false} is VALID [2018-11-23 12:28:51,192 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:51,192 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:51,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,193 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:51,193 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,193 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:51,193 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,193 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:51,193 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,194 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:51,194 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,194 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:51,194 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,194 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:51,194 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,195 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:51,195 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,195 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:51,195 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,195 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:51,195 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,196 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:51,196 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:28:51,196 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:51,196 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:51,196 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:51,196 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:51,196 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:51,197 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:51,197 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,197 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:51,197 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,197 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:51,197 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,197 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:51,198 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,198 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:51,198 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,198 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:51,198 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,198 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:51,198 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,198 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:51,198 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,198 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:51,199 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,199 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:51,199 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,199 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:51,199 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:28:51,199 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:51,199 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:51,199 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:51,199 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:51,199 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,200 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:51,200 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,200 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:51,200 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,200 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:51,200 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,200 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:51,200 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,200 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:51,201 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,201 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:51,201 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,201 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:51,201 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,201 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:51,201 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,201 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:51,201 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 999); {24969#false} is VALID [2018-11-23 12:28:51,201 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:51,202 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:51,202 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:51,202 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,202 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:51,202 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,202 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:51,202 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,202 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:51,202 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,202 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:51,203 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,203 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:51,203 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,203 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:51,203 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,203 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:51,203 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,203 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:51,203 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,203 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:51,204 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 1000);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:51,204 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:51,204 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 1000); {24968#true} is VALID [2018-11-23 12:28:51,204 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:51,204 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:51,204 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:51,204 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:51,204 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:51,204 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:51,218 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:51,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:51,218 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:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:51,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:51,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:51,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:51,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:28:51,685 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:51,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:28:51,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:28:51,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret12 := main(); {24968#true} is VALID [2018-11-23 12:28:51,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:51,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:51,686 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:51,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:51,687 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:51,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:51,688 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:51,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:51,688 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:51,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:51,689 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:51,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:51,691 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:51,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:51,692 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:51,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:51,693 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:51,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:51,694 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:51,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:51,696 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:51,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:51,697 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:51,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:51,698 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:51,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:51,699 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:51,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:51,700 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:51,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:51,702 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:51,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:51,703 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:51,703 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:51,704 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:51,705 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:51,705 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:51,706 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:51,707 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:51,707 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:51,708 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:51,708 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:51,709 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:51,710 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:51,710 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:51,711 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:51,712 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:51,712 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:51,713 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:51,713 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:51,714 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:51,715 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:51,715 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:51,716 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:51,716 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:51,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:51,718 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:51,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:51,719 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:51,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:51,720 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:51,721 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:51,721 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:51,722 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:51,723 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:51,723 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 1000); {24969#false} is VALID [2018-11-23 12:28:51,724 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:51,724 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:51,724 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,724 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:51,724 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,724 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:51,725 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,725 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:51,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,725 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:51,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,726 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:51,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,726 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:51,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,726 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:51,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,727 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:51,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,727 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:51,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,727 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:51,727 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:28:51,727 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:51,727 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:51,728 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:28:51,728 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:51,728 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:51,728 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:51,728 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,728 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:51,728 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,728 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:51,728 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,729 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:51,729 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,729 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:51,729 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,729 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:51,729 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,729 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:51,729 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,729 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:51,729 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,730 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:51,730 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,730 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:51,730 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,730 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:51,730 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:28:51,730 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:51,730 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:51,730 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:28:51,730 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:51,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,731 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:51,731 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,731 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:51,731 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,731 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:51,731 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,731 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:51,731 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,731 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:51,732 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,732 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:51,732 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,732 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:51,732 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,732 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:51,732 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:51,732 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:51,732 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 999); {24969#false} is VALID [2018-11-23 12:28:51,732 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:28:51,733 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:51,733 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:51,733 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,733 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:51,733 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,733 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:51,733 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,733 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:51,733 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,733 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:51,734 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,734 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:51,734 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,734 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:51,734 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,734 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:51,734 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,734 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:51,734 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,734 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:51,735 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 1000);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:51,735 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:51,735 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 1000); {24969#false} is VALID [2018-11-23 12:28:51,735 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:51,735 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:28:51,735 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:28:51,735 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:51,735 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:51,735 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:28:51,750 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:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:51,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:28:51,769 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:51,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:51,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:28:51,893 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:51,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:28:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:28:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:51,895 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:28:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:52,803 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:28:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:28:52,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:28:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:28:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:28:52,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:28:52,919 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:52,922 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:28:52,922 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:28:52,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:28:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:28:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:28:53,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:53,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:53,065 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:53,065 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:28:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:53,067 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:53,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:53,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:53,068 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:53,068 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:28:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:53,070 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:28:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:28:53,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:53,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:53,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:53,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:28:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:28:53,073 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:28:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:53,073 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:28:53,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:28:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:28:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:28:53,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:53,075 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:53,075 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:53,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:28:53,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:53,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:53,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:55,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:55,312 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:55,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:55,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:55,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:55,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:55,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:28:55,315 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:55,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:55,315 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:55,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:55,316 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:55,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:55,317 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:55,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:55,318 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:55,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:55,320 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:55,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:55,321 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:55,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:55,322 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:55,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:55,323 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:55,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:55,324 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:55,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:55,326 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:55,326 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:55,327 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:55,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:55,328 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:55,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:55,329 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:55,330 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:55,331 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:55,331 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:55,332 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:55,332 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:55,333 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:55,334 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:55,334 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:55,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:55,336 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:55,336 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:55,337 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:55,337 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:55,338 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:55,339 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:55,339 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:55,340 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:55,341 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:55,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:55,342 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:55,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:55,343 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:55,344 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:55,344 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:55,345 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:55,346 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:55,346 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:55,347 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:55,347 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:55,348 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:55,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:55,349 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:55,350 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:55,350 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:55,351 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:55,352 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:55,352 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:55,353 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:55,354 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 1000); {26242#false} is VALID [2018-11-23 12:28:55,354 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:55,354 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:55,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,354 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:55,354 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,355 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:55,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,355 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:55,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,355 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:55,356 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,356 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:55,356 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,356 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:55,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,356 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:55,357 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,357 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:55,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,357 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:55,357 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,357 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:55,358 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:28:55,358 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:55,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:55,358 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:28:55,358 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:55,359 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:55,359 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:55,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,359 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:55,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,359 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:55,359 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,359 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:55,360 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,360 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:55,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,360 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:55,360 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,360 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:55,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,360 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:55,360 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,360 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:55,361 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,361 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:55,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,361 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:55,361 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:28:55,361 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:55,361 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:55,361 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:28:55,361 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:55,361 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,362 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:55,362 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,362 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:55,362 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,362 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:55,362 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,362 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:55,362 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,362 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:55,362 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,363 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:55,363 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,363 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:55,363 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,363 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:55,363 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:55,363 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:55,363 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 999); {26242#false} is VALID [2018-11-23 12:28:55,363 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:55,364 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:55,364 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:55,364 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,364 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:55,364 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,364 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:55,364 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,364 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:55,364 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,364 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:55,365 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,365 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:55,365 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,365 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:55,365 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,365 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:55,365 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,365 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:55,365 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,365 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:55,366 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:55,366 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:55,366 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:28:55,366 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:55,366 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:55,366 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:55,366 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:55,366 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:55,366 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:55,381 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:55,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:55,381 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:55,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:55,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:28:55,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:55,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:56,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:28:56,233 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:56,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:56,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:28:56,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret12 := main(); {26241#true} is VALID [2018-11-23 12:28:56,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26241#true} is VALID [2018-11-23 12:28:56,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,234 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:56,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,234 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:56,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,235 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:56,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,235 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:56,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,235 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:56,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,236 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:56,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,236 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:56,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,236 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:56,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,236 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:56,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,237 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:56,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,237 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:56,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,237 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:56,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,237 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:56,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,237 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:56,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,238 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:56,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,238 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:56,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,238 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:56,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,238 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:56,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,238 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:56,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,239 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:56,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,239 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:56,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,239 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:56,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,239 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:56,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,239 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:56,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,240 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:56,240 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,240 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:56,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,240 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:56,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,240 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:56,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,240 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:56,240 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,241 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:56,241 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,241 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:56,241 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,241 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:56,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 1000);assume -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:56,241 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:56,241 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 1000); {26241#true} is VALID [2018-11-23 12:28:56,241 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:56,241 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:56,242 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,242 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:56,242 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,242 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:56,242 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,242 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:56,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,242 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:56,242 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,242 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:56,243 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,243 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:56,243 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,243 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:56,243 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,243 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:56,243 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,243 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:56,243 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,244 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:56,244 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:28:56,244 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:56,244 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:56,244 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:28:56,244 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:56,244 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:56,244 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:56,244 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,244 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:56,245 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,245 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:56,245 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,245 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:56,245 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,245 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:56,245 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,245 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:56,245 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,245 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:56,246 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,246 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:56,246 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,246 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:56,246 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,246 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:56,246 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 1000);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:56,246 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:56,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 1000); {26241#true} is VALID [2018-11-23 12:28:56,246 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:56,247 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:28:56,247 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:28:56,247 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:56,248 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:56,248 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:56,248 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:56,252 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:56,252 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:56,252 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:56,253 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:56,253 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:56,253 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:56,254 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:56,254 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:56,255 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:56,255 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:56,255 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:56,256 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:56,256 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:56,257 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:56,258 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:56,258 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 999); {26242#false} is VALID [2018-11-23 12:28:56,259 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:28:56,259 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:56,259 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:56,259 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,259 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:56,259 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,260 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:56,260 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,260 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:56,260 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,260 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:56,260 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,261 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:56,261 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,261 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:56,261 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,261 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:56,262 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,262 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:56,262 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,262 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:56,262 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 1000);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:56,262 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:56,263 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 1000); {26242#false} is VALID [2018-11-23 12:28:56,263 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:56,263 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:28:56,263 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:28:56,263 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:56,263 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:56,264 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:28:56,276 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:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:56,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:28:56,298 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:56,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:56,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:28:56,429 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:56,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:28:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:28:56,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:56,431 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:28:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:57,627 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:28:57,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:28:57,627 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:28:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:28:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:28:57,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:28:57,770 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:57,772 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:28:57,773 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:28:57,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:28:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:28:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:28:58,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:58,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:58,099 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:58,099 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:28:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,101 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:58,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,102 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:58,102 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:28:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:58,104 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:28:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:28:58,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:58,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:58,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:58,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:28:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:28:58,106 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:28:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:58,106 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:28:58,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:28:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:28:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:28:58,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:58,107 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:58,107 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:58,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:28:58,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:58,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:58,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:58,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:59,136 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:59,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:59,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:59,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:59,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:28:59,138 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:59,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:59,139 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:59,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:59,140 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:59,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:59,141 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:59,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:59,142 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:59,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:59,144 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:59,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:59,145 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:59,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:59,146 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:59,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:59,147 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:59,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:59,149 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:59,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:59,150 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:59,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:59,151 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:59,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:59,152 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:59,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:59,153 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:59,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:59,155 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:59,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:59,156 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:59,156 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:59,157 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:59,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:59,158 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:59,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:59,160 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:59,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:59,161 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:59,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:59,162 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:59,163 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:59,163 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:59,164 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:59,165 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:59,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:59,166 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:59,166 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:59,167 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:59,168 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:59,168 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:59,169 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:59,170 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:59,170 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:59,171 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:59,171 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:59,172 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:59,173 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:59,173 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:59,174 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:59,175 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:59,175 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:59,176 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:59,176 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:59,177 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:59,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:59,178 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:59,179 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 1000); {27554#false} is VALID [2018-11-23 12:28:59,179 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:59,179 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:59,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,180 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:59,180 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,180 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:59,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,180 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:59,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,181 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:59,181 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,181 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:59,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,181 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:59,182 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,182 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:59,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,182 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:59,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,182 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:59,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,183 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:59,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,183 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:59,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,183 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:28:59,183 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:59,183 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:59,183 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:59,183 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,183 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:59,184 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,184 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:59,184 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,184 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:59,184 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,184 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:59,184 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,184 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:59,184 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,184 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:59,185 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,185 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:59,185 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,185 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:59,185 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,185 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:59,185 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,185 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:59,185 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,186 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:59,186 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,186 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:28:59,186 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:59,186 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,186 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:59,186 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,186 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:59,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,186 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:59,187 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,187 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:59,187 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,187 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:59,187 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,187 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:59,187 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,187 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:59,187 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,187 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:59,188 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,188 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:59,188 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:59,188 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:59,188 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 999); {27554#false} is VALID [2018-11-23 12:28:59,188 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:59,188 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:59,188 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:59,188 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,189 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:59,189 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,189 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:59,189 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,189 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:59,189 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,189 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:59,189 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,189 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:59,189 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,190 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:59,190 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,190 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:59,190 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,190 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:59,190 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,190 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:59,190 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,190 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:59,190 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,191 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:59,191 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,191 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:59,191 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:59,191 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:59,191 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:59,206 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:59,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:59,206 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:59,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:59,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:59,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:59,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:59,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:28:59,736 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:59,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:28:59,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret12 := main(); {27553#true} is VALID [2018-11-23 12:28:59,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27553#true} is VALID [2018-11-23 12:28:59,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,737 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:59,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,738 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:59,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,738 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:59,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,738 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:59,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,739 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:59,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,739 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:59,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,739 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:59,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,739 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:59,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,739 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:59,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,740 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:59,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,740 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:59,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,740 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:59,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,740 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:59,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,740 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:59,740 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,741 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:59,741 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,741 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:59,741 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,741 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:59,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,741 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:59,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,741 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:59,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,742 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:59,742 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,742 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:59,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,742 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:59,742 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,742 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:59,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,742 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:59,743 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,743 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:59,743 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,743 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:59,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,743 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:59,743 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,743 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:59,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,744 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:59,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,744 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:59,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,744 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:59,744 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,744 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:59,744 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,744 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:59,744 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 1000);assume -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:59,745 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:59,745 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,745 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:59,745 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:59,745 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,745 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:59,745 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,745 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:59,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,745 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:59,746 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,746 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:59,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,746 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:59,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,746 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:59,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,746 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:59,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,746 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:59,747 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,747 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:59,747 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,747 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:59,747 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,747 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:59,747 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,747 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:28:59,747 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:59,748 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:59,748 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:59,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,748 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:59,748 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,748 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:59,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,748 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:59,748 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,748 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:59,749 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,749 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:59,749 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,749 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:59,749 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,749 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:59,749 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,749 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:59,749 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,750 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:59,750 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 1000);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:59,750 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:59,750 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 1000); {27553#true} is VALID [2018-11-23 12:28:59,750 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:59,750 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:28:59,750 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:28:59,751 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:59,751 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:28:59,752 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:59,752 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:28:59,752 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:59,753 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:28:59,753 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:59,753 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:28:59,754 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:59,754 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:28:59,755 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:59,755 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:28:59,756 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:59,756 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:28:59,757 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:59,758 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:28:59,758 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:59,759 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:28:59,760 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:59,760 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:28:59,761 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:59,762 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 999); {27554#false} is VALID [2018-11-23 12:28:59,762 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:28:59,762 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:59,762 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:59,762 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,762 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:59,763 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,763 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:59,763 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,763 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:59,763 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,764 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:59,764 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,764 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:59,764 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,764 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:59,764 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,764 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:59,765 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,765 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:59,765 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,765 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:59,765 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 1000);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:59,765 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:59,765 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 1000); {27554#false} is VALID [2018-11-23 12:28:59,765 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:59,765 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:28:59,765 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:28:59,766 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:59,766 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:59,766 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:28:59,778 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:59,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:59,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:28:59,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:28:59,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:59,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:28:59,970 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:59,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:28:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:28:59,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:28:59,972 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:29:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:00,638 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:29:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:29:00,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:29:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:29:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:29:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:29:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:29:00,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:29:01,121 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:29:01,125 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:29:01,125 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:29:01,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:29:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:29:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:29:01,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:01,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:29:01,179 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:29:01,179 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:29:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:01,182 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:29:01,182 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:29:01,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:01,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:01,182 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:29:01,182 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:29:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:01,184 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:29:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:29:01,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:01,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:01,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:01,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:29:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:29:01,188 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:29:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:01,188 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:29:01,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:29:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:29:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:29:01,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:01,189 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:29:01,189 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:01,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:29:01,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:01,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:01,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:01,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:01,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:02,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:29:02,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:29:02,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:29:02,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:29:02,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:29:02,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:29:02,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:29:02,061 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:29:02,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:02,062 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:29:02,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:02,063 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:29:02,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:02,064 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:29:02,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:02,066 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:29:02,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:02,067 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:29:02,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:02,068 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:29:02,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:02,069 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:29:02,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:02,071 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:29:02,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:02,072 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:29:02,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:02,073 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:29:02,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:02,074 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:29:02,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:02,075 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:29:02,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:02,077 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:29:02,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:02,078 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:29:02,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:02,079 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:29:02,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:02,080 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:29:02,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:02,082 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:29:02,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:02,083 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:29:02,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:02,084 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:29:02,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:02,085 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:29:02,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:02,087 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:29:02,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:02,088 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:29:02,088 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:02,089 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:29:02,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:29:02,090 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:29:02,091 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:29:02,091 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:29:02,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:29:02,093 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:29:02,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:29:02,094 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:29:02,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:29:02,095 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:29:02,096 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:29:02,096 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:29:02,097 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:29:02,098 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:29:02,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:29:02,099 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:29:02,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:29:02,100 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:29:02,101 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:29:02,101 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:29:02,102 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:29:02,103 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:29:02,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 1000); {28903#false} is VALID [2018-11-23 12:29:02,103 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:29:02,104 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:29:02,104 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,104 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:29:02,104 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,104 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:29:02,105 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,105 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:29:02,105 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,105 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:29:02,105 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,105 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:29:02,106 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,106 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:29:02,106 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,106 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:29:02,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,106 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:29:02,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,107 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:29:02,107 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,107 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:29:02,107 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:29:02,107 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:29:02,107 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:29:02,107 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:29:02,107 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:29:02,108 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:29:02,108 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:29:02,108 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,108 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:29:02,108 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,108 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:29:02,108 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,108 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:29:02,108 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,108 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:29:02,109 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,109 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:29:02,109 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,109 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:29:02,109 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,109 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:29:02,109 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,109 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:29:02,109 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,110 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:29:02,110 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,110 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:29:02,110 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:29:02,110 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:29:02,110 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:29:02,110 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:29:02,110 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:29:02,110 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,110 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,111 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {28903#false} is VALID [2018-11-23 12:29:02,112 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {28903#false} is VALID [2018-11-23 12:29:02,113 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 999); {28903#false} is VALID [2018-11-23 12:29:02,113 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:29:02,113 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:29:02,113 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:29:02,113 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,113 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:29:02,113 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,113 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:29:02,113 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,114 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:29:02,114 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,114 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:29:02,114 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,114 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:29:02,114 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,114 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:29:02,114 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,114 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:29:02,114 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,115 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:29:02,115 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,115 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:29:02,115 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 1000);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:29:02,115 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:29:02,115 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 1000); {28902#true} is VALID [2018-11-23 12:29:02,115 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:29:02,115 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:29:02,115 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:29:02,115 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {28903#false} is VALID [2018-11-23 12:29:02,116 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:29:02,116 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:29:02,131 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:29:02,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:02,131 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:29:02,141 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:07,139 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:30:07,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:07,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:30:07,656 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:07,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:30:07,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:30:07,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret12 := main(); {28902#true} is VALID [2018-11-23 12:30:07,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28902#true} is VALID [2018-11-23 12:30:07,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,657 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:07,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,658 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:07,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,658 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:07,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,659 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:07,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,659 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:07,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,659 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:07,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,660 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:07,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,660 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:07,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,660 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:07,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,660 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:07,660 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,660 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:07,660 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,661 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:07,661 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,661 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:07,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,661 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:07,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,661 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:07,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,661 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:07,662 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,662 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:07,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,662 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:07,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,662 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:07,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,662 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:07,662 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,662 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:07,663 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,663 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:07,663 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,663 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:07,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,663 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:07,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,663 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:07,663 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,663 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:07,664 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,664 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:07,664 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,664 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:07,664 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,664 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:07,664 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,664 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:07,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,664 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:07,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,665 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:07,665 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,665 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:07,665 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,665 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:07,665 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 1000);assume -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:07,665 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:07,665 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 1000); {28902#true} is VALID [2018-11-23 12:30:07,665 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:07,666 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:07,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29177#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:07,667 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:07,667 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29184#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:07,668 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:07,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29191#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:07,668 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:07,669 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29198#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:07,669 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:07,669 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29205#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:07,670 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:07,671 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29212#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:07,671 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:07,672 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= mapsum_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29219#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:07,673 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:07,673 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= mapsum_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29226#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:07,674 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:07,674 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= mapsum_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29233#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:07,675 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:07,676 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= mapsum_~i~0 9)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {29240#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:07,676 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:07,677 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= mapsum_~i~0 10)} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:30:07,677 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:07,677 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:07,677 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:30:07,678 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:07,678 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:07,678 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:07,678 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,678 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:07,679 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,679 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:07,679 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,679 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:07,679 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,679 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:07,680 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,680 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:07,680 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,680 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:07,680 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,680 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:07,680 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,680 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:07,680 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,681 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:07,681 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,681 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:07,681 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:30:07,681 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:07,681 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:07,681 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:30:07,681 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:07,681 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,682 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:07,682 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,682 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:07,682 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,682 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:07,682 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,682 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:07,682 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,682 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:07,683 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,683 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:07,683 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,683 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:07,683 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,683 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:07,683 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,683 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:07,683 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,683 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:07,684 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:07,684 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:07,684 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 999); {28903#false} is VALID [2018-11-23 12:30:07,684 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:30:07,684 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:07,684 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:07,684 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,684 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:07,684 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,684 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:07,685 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,685 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:07,685 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,685 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:07,685 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,685 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:07,685 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,685 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:07,685 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,685 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:07,686 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,686 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:07,686 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,686 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:07,686 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 1000);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:07,686 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:07,686 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 1000); {28903#false} is VALID [2018-11-23 12:30:07,686 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:07,686 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:30:07,686 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:30:07,687 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:07,687 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:07,687 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:30:07,699 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:07,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:07,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:30:07,730 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:30:07,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:07,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:30:07,869 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:07,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:30:07,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:30:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:30:07,872 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:30:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,734 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:30:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:30:08,734 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:30:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:30:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:30:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:30:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:30:08,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:30:08,893 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:08,896 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:30:08,896 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:30:08,898 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:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:30:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:30:08,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:08,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:08,972 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:08,972 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:30:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,976 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:30:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:30:08,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,976 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:30:08,976 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:30:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,979 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:30:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:30:08,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:08,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:30:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:30:08,983 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:30:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:08,983 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:30:08,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:30:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:30:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:30:08,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:08,985 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:08,985 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:08,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:30:08,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:08,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:08,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:10,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:30:10,691 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:10,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:10,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:30:10,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:30:10,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:30:10,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:30:10,693 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:10,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:10,694 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:10,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:10,694 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:10,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:10,696 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:10,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:10,697 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:10,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:10,698 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:10,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:10,699 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:10,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:10,700 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:10,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:10,701 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:10,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:10,703 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:10,703 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:10,704 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:10,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:10,705 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:10,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:10,706 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:10,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:10,707 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:10,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:10,708 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:10,709 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:10,710 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:10,710 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:10,711 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:10,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:10,712 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:10,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:10,713 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:10,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:10,714 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:10,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:10,715 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:10,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:10,716 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:10,717 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:10,718 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:10,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:10,719 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:10,719 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:10,720 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:10,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:10,721 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:10,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:10,722 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:10,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:10,723 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:10,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:10,725 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:10,725 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:10,726 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:10,726 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:10,727 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:10,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:10,728 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:10,729 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:10,729 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:10,730 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:10,730 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:10,731 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:10,732 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:10,732 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:10,733 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:10,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 1000); {30288#false} is VALID [2018-11-23 12:30:10,734 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:10,734 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:10,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,734 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:10,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,734 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:10,735 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,735 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:10,735 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,735 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:10,735 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,735 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:10,736 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,736 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:10,736 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,736 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:10,736 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,736 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:10,737 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,737 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:10,737 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,737 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:10,737 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,737 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:10,737 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:30:10,737 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:10,737 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:10,737 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:30:10,738 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:10,738 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:10,738 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:10,738 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,738 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:10,738 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,738 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:10,738 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,738 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:10,738 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,739 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:10,739 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,739 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:10,739 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,739 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:10,739 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,739 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:10,739 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,739 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:10,739 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,740 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:10,740 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,740 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:10,740 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,740 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:10,740 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:30:10,740 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:10,740 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:10,740 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:30:10,741 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:10,741 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,741 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:10,741 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,741 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:10,741 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,741 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:10,741 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,741 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:10,741 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,742 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:10,742 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,742 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:10,742 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,742 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:10,742 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,742 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:10,742 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,742 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:10,742 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,743 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:10,743 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:10,743 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:10,743 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 999); {30288#false} is VALID [2018-11-23 12:30:10,743 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:30:10,743 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:10,743 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:10,743 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,743 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:10,743 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,745 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:10,745 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,745 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:10,745 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,745 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:10,745 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,745 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:10,745 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:10,745 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:10,745 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:30:10,746 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:10,746 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:10,746 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:30:10,746 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:10,746 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:10,746 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:30:10,762 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:10,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:10,763 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:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:16,869 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:30:16,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:16,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:17,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:30:17,488 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:17,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:17,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:30:17,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret12 := main(); {30287#true} is VALID [2018-11-23 12:30:17,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30287#true} is VALID [2018-11-23 12:30:17,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,489 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:17,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,489 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:17,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,489 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:17,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,490 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:17,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,490 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:17,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,490 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:17,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,491 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:17,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,491 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:17,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,491 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:17,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,492 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:17,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,492 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:17,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,492 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:17,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,492 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:17,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,492 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:17,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,493 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:17,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,493 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:17,493 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,493 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:17,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,493 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:17,493 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,493 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:17,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,494 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:17,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,494 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:17,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,494 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:17,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,494 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:17,494 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,494 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:17,495 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,495 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:17,495 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,495 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:17,495 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,495 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:17,495 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,495 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:17,495 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,495 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:17,496 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,496 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:17,496 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,496 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:17,496 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,496 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:17,496 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,496 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:17,496 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,496 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:17,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,497 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:17,497 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 1000);assume -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:17,497 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:17,497 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 1000); {30287#true} is VALID [2018-11-23 12:30:17,497 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:17,497 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:17,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,497 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:17,498 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,498 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:17,498 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,498 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:17,498 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,498 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:17,498 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,498 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:17,498 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,498 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:17,499 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,499 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:17,499 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,499 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:17,499 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,499 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:17,499 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,499 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:17,499 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,499 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:17,500 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:30:17,500 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:17,500 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:17,500 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:30:17,500 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:17,500 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:17,500 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:17,500 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,500 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:17,500 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,501 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:17,501 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,501 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:17,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,501 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:17,501 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,501 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:17,501 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,501 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:17,502 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,502 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:17,502 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,502 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:17,502 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,502 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:17,502 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,502 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:17,502 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 1000);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:17,502 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:17,503 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 1000); {30287#true} is VALID [2018-11-23 12:30:17,503 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:17,503 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:30:17,503 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:30:17,503 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:17,503 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,503 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:17,503 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,503 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:17,503 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,504 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:17,504 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,504 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:17,504 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,504 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:17,504 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,504 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:17,504 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,504 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:17,505 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,505 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:17,505 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,505 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:17,505 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,505 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:17,505 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {30287#true} is VALID [2018-11-23 12:30:17,505 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:17,505 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 999); {30287#true} is VALID [2018-11-23 12:30:17,505 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:30:17,506 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:17,506 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:17,506 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= mapsum_~i~0 0)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30815#(<= mapsum_~i~0 0)} is VALID [2018-11-23 12:30:17,507 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:17,507 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= mapsum_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30822#(<= mapsum_~i~0 1)} is VALID [2018-11-23 12:30:17,508 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:17,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= mapsum_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30829#(<= mapsum_~i~0 2)} is VALID [2018-11-23 12:30:17,509 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:17,509 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= mapsum_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30836#(<= mapsum_~i~0 3)} is VALID [2018-11-23 12:30:17,510 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:17,510 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= mapsum_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30843#(<= mapsum_~i~0 4)} is VALID [2018-11-23 12:30:17,511 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:17,512 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= mapsum_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30850#(<= mapsum_~i~0 5)} is VALID [2018-11-23 12:30:17,512 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:17,513 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= mapsum_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30857#(<= mapsum_~i~0 6)} is VALID [2018-11-23 12:30:17,513 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:17,514 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= mapsum_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30864#(<= mapsum_~i~0 7)} is VALID [2018-11-23 12:30:17,515 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:17,515 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= mapsum_~i~0 8)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30871#(<= mapsum_~i~0 8)} is VALID [2018-11-23 12:30:17,516 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:17,516 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= mapsum_~i~0 9)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30878#(<= mapsum_~i~0 9)} is VALID [2018-11-23 12:30:17,517 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:17,518 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= mapsum_~i~0 10)} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {30885#(<= mapsum_~i~0 10)} is VALID [2018-11-23 12:30:17,518 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:17,519 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= mapsum_~i~0 11)} assume !(~i~0 < 1000); {30288#false} is VALID [2018-11-23 12:30:17,519 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:17,519 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:30:17,520 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:30:17,520 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:17,520 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:17,520 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:30:17,535 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:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:17,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:30:17,557 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:17,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:17,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:30:17,700 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:17,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:30:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:30:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:17,703 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:30:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:19,292 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:30:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:30:19,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:30:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:30:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:30:19,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:30:19,458 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:19,461 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:30:19,461 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:30:19,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:30:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:30:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:30:19,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:19,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:19,517 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:19,517 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:30:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:19,519 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:19,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:19,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:19,520 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:19,520 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:30:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:19,522 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:30:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:19,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:19,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:19,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:19,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:30:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:30:19,524 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:30:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:19,525 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:30:19,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:30:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:30:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:30:19,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:19,526 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:19,526 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:19,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:30:19,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:19,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:19,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:20,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:30:20,377 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:20,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:20,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:30:20,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret12 := main(); {31721#true} is VALID [2018-11-23 12:30:20,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:30:20,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:30:20,379 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:20,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:20,380 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:20,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:20,381 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:20,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:20,382 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:20,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:20,382 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:20,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:20,383 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:20,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:20,385 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:20,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:20,386 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:20,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:20,387 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:20,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:20,388 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:20,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:20,390 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:20,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:20,391 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:20,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:20,392 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:20,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:20,393 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:20,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:20,395 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:20,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:20,396 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:20,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:20,397 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:20,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:20,398 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:20,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:20,400 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:20,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:20,401 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:20,401 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:20,402 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:20,403 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:20,403 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:20,404 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:20,405 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:20,405 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:20,406 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:20,406 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:20,407 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:20,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:20,408 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:20,409 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:20,410 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:20,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:20,411 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:20,411 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:20,412 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:20,413 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:20,413 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:20,414 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:20,415 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:20,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:20,416 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:20,416 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:20,417 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:20,418 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:20,418 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:20,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:20,420 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:20,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:20,421 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:20,421 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:20,422 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:20,423 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 1000); {31722#false} is VALID [2018-11-23 12:30:20,423 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:20,423 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:20,423 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,423 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:20,424 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,424 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:20,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,424 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:20,424 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,425 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:20,425 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,425 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:20,425 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,425 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:20,425 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,426 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:20,426 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,426 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:20,426 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,426 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:20,426 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,426 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:20,426 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,426 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:20,427 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,427 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:20,427 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:30:20,427 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:20,427 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:20,427 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:30:20,427 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:20,427 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:20,427 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:20,428 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,428 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:20,428 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,428 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:20,428 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,428 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:20,428 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,428 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:20,428 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,428 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:20,429 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,429 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:20,429 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,429 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:20,429 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,429 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:20,429 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,429 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:20,429 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,429 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:20,430 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,430 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:20,430 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,430 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:20,430 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:30:20,430 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:20,430 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:20,430 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:30:20,430 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:20,430 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,431 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:20,431 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,431 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:20,431 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,431 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:20,431 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,431 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:20,431 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,431 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:20,431 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,432 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:20,432 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,432 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:20,432 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,432 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:20,432 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,432 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:20,432 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,432 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:20,432 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,433 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:20,433 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 999); {31722#false} is VALID [2018-11-23 12:30:20,433 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:30:20,433 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:20,433 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:20,433 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,433 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:20,433 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,433 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:20,434 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,434 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:20,434 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,434 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:20,434 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,434 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:20,434 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,434 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:20,434 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,434 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:20,435 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,435 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:20,435 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,435 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:20,435 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,435 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:20,435 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,435 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:20,435 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 1000);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:20,435 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:20,436 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 1000); {31721#true} is VALID [2018-11-23 12:30:20,436 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:20,436 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:20,436 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:30:20,436 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:20,436 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:20,436 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:30:20,454 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:20,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:20,454 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:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:20,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:20,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:30:20,907 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:20,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:30:20,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:30:20,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret12 := main(); {31721#true} is VALID [2018-11-23 12:30:20,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:20,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:20,910 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:20,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:20,911 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:20,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:20,911 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:20,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:20,913 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:20,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:20,914 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:20,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:20,915 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:20,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:20,916 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:20,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:20,918 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:20,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:20,919 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:20,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:20,920 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:20,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:20,921 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:20,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:20,923 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:20,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:20,924 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:20,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:20,925 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:20,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:20,926 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:20,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:20,928 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:20,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:20,929 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:20,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:20,930 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:20,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:20,931 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:20,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:20,933 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:20,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:20,934 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:20,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:20,935 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:20,936 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:20,936 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:20,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:20,938 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:20,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:20,939 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:20,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:20,940 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:20,941 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:20,941 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:20,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:20,943 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:20,943 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:20,944 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:20,945 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:20,945 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:20,946 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:20,946 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:20,947 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:20,948 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:20,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:20,949 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:20,950 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:20,950 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:20,951 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:20,951 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:20,952 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:20,953 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:20,953 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:20,954 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:20,955 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 1000); {31722#false} is VALID [2018-11-23 12:30:20,955 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:20,955 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:20,955 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,955 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:20,956 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,956 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:20,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,956 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:20,956 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,956 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:20,957 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,957 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:20,957 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,957 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:20,957 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,958 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:20,958 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,958 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:20,958 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,958 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:20,958 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,958 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:20,958 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,958 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:20,959 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,959 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:20,959 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:30:20,959 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:20,959 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:20,959 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:30:20,959 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:20,959 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:20,959 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:20,960 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,960 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:20,960 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,960 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:20,960 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,960 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:20,960 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,960 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:20,960 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,960 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:20,961 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,961 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:20,961 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,961 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:20,961 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,961 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:20,961 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,961 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:20,961 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,962 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:20,962 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,962 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:20,962 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,962 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:20,962 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:30:20,962 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:20,962 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:20,962 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:30:20,962 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:20,963 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,963 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:20,963 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,963 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:20,963 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,963 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:20,963 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,963 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:20,963 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,964 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:20,964 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,964 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:20,964 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,964 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:20,964 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,964 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:20,964 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,964 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:20,965 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,965 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:20,965 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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:20,965 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:20,965 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 999); {31722#false} is VALID [2018-11-23 12:30:20,965 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:30:20,965 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:20,965 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:20,965 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,965 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:20,966 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,966 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:20,966 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,966 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:20,966 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,966 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:20,966 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,966 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:20,966 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,966 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:20,967 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,967 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:20,967 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,967 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:20,967 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,967 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:20,967 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,967 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:20,967 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,967 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:20,968 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 1000);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:20,968 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:20,968 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 1000); {31722#false} is VALID [2018-11-23 12:30:20,968 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:20,968 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:30:20,968 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:30:20,968 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:20,968 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:20,968 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:30:20,984 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:21,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:30:21,004 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:21,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:21,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:30:21,125 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:21,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:30:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:30:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:21,126 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:30:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:21,770 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:30:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:30:21,770 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:30:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:30:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:30:21,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:30:21,953 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:21,957 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:30:21,957 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:30:21,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:30:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:30:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:30:22,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:22,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:22,205 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:22,205 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:30:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:22,207 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:30:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:30:22,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:22,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:22,207 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:30:22,207 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:30:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:22,209 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:30:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:30:22,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:22,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:22,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:22,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:30:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:30:22,212 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:30:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:22,212 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:30:22,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:30:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:30:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:30:22,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:22,213 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:22,213 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2018-11-23 12:30:22,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:22,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:23,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:30:23,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:30:23,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:30:23,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:30:23,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret12 := main(); {33179#true} is VALID [2018-11-23 12:30:23,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:30:23,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {33181#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:30:23,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {33181#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:23,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:23,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:23,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:23,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:23,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:23,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:23,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:23,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:23,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:23,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:23,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:23,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:23,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:23,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:23,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:23,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:23,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:23,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:23,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:23,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:23,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:23,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:23,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:23,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:23,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:23,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:23,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:23,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:23,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:23,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:23,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:23,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:23,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:23,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:23,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:23,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:23,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:23,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:23,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:23,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:23,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:23,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:23,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:23,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:23,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:23,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:23,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:23,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:23,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:23,398 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:23,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:23,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:23,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:23,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:23,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:23,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:23,403 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:23,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:23,404 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:23,405 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:23,405 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:23,406 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:23,406 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:23,407 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:23,408 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:23,408 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:23,409 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:23,409 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:23,410 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:23,411 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:23,411 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:23,412 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:23,413 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:23,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:23,414 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 1000); {33180#false} is VALID [2018-11-23 12:30:23,414 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:30:23,414 INFO L273 TraceCheckUtils]: 84: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33179#true} is VALID [2018-11-23 12:30:23,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,415 INFO L273 TraceCheckUtils]: 86: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,415 INFO L273 TraceCheckUtils]: 87: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,415 INFO L273 TraceCheckUtils]: 88: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,415 INFO L273 TraceCheckUtils]: 89: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,415 INFO L273 TraceCheckUtils]: 90: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 92: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 93: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 94: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 95: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,416 INFO L273 TraceCheckUtils]: 96: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 98: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 99: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 100: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 101: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 102: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 103: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 104: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 105: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,417 INFO L273 TraceCheckUtils]: 106: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 107: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 108: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 109: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 110: Hoare triple {33179#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 111: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33179#true} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:30:23,418 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 115: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33179#true} is VALID [2018-11-23 12:30:23,418 INFO L273 TraceCheckUtils]: 116: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 117: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 118: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 119: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 120: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 121: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 122: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 123: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 124: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,419 INFO L273 TraceCheckUtils]: 125: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 126: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 127: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 128: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 129: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 130: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 131: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 132: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 133: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 134: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,420 INFO L273 TraceCheckUtils]: 135: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 136: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 137: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 138: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 139: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 140: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 141: Hoare triple {33179#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 142: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:30:23,421 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33179#true} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:30:23,421 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,422 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,423 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 999); {33180#false} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:30:23,424 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 170: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33179#true} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 171: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 172: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 173: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,424 INFO L273 TraceCheckUtils]: 174: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 175: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 176: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 177: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 178: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 179: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 180: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 181: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 182: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 183: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,425 INFO L273 TraceCheckUtils]: 184: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 185: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 186: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 187: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 188: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 189: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 190: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 191: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 192: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 193: Hoare triple {33179#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33179#true} is VALID [2018-11-23 12:30:23,426 INFO L273 TraceCheckUtils]: 194: Hoare triple {33179#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33179#true} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 195: Hoare triple {33179#true} assume !(~i~0 < 1000); {33179#true} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 196: Hoare triple {33179#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 197: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:30:23,427 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33179#true} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33180#false} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:30:23,427 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:30:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:23,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:23,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:23,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:23,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:23,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:24,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:30:24,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:30:24,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:30:24,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:30:24,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret12 := main(); {33179#true} is VALID [2018-11-23 12:30:24,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:24,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {33238#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:24,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {33238#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:24,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:24,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:24,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:24,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:24,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:24,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:24,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:24,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:24,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:24,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:24,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:24,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:24,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:24,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:24,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:24,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:24,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:24,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:24,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:24,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:24,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:24,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:24,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:24,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:24,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:24,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:24,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:24,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:24,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:24,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:24,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:24,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:24,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:24,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:24,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:24,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:24,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:24,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:24,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:24,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:24,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:24,790 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:24,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:24,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:24,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:24,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:24,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:24,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:24,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:24,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:24,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:24,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:24,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:24,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:24,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:24,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:24,799 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:24,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:24,801 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:24,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:24,802 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:24,803 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:24,803 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:24,804 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:24,805 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:24,805 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:24,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:24,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:24,807 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:24,808 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:24,808 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:24,809 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:24,809 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:24,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:24,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 1000); {33180#false} is VALID [2018-11-23 12:30:24,811 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:30:24,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33180#false} is VALID [2018-11-23 12:30:24,811 INFO L273 TraceCheckUtils]: 85: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,812 INFO L273 TraceCheckUtils]: 87: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 91: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 93: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 94: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 95: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,813 INFO L273 TraceCheckUtils]: 96: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 97: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 98: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 99: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 100: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 101: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 102: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 103: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,814 INFO L273 TraceCheckUtils]: 104: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 105: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 106: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 107: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 108: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 109: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 110: Hoare triple {33180#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 111: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33180#false} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:30:24,815 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 115: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 116: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 117: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 118: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 119: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 120: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 121: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 122: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 123: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,816 INFO L273 TraceCheckUtils]: 124: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 125: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 126: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 127: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 128: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 129: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 130: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 131: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 132: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,817 INFO L273 TraceCheckUtils]: 133: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 134: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 135: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 136: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 137: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 138: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 139: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 140: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 141: Hoare triple {33180#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L273 TraceCheckUtils]: 142: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:30:24,818 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33180#false} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,819 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,820 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 999); {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 170: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 171: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,821 INFO L273 TraceCheckUtils]: 172: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 173: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 174: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 175: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 176: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 177: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 178: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 179: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 180: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 181: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,822 INFO L273 TraceCheckUtils]: 182: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 183: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 184: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 185: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 186: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 187: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 188: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 189: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 190: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 191: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,823 INFO L273 TraceCheckUtils]: 192: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 193: Hoare triple {33180#false} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 194: Hoare triple {33180#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 195: Hoare triple {33180#false} assume !(~i~0 < 1000); {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 196: Hoare triple {33180#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 197: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33180#false} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:30:24,824 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:30:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:24,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:30:24,863 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:30:24,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:24,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:30:24,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:24,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:30:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:30:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:24,984 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:30:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:25,364 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:30:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:30:25,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:30:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:30:25,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:30:25,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:25,498 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:30:25,498 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:30:25,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:30:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:30:25,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:25,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:25,553 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:25,553 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:30:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:25,556 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:25,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:25,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:25,556 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:25,556 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:30:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:25,559 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:30:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:30:25,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:25,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:25,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:25,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:30:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:30:25,563 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:30:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:25,564 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:30:25,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:30:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:30:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:30:25,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:25,565 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:25,565 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:25,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2018-11-23 12:30:25,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:25,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:25,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:26,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:30:26,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {34654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34654#true} is VALID [2018-11-23 12:30:26,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:30:26,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:30:26,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret12 := main(); {34654#true} is VALID [2018-11-23 12:30:26,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:30:26,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {34656#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:30:26,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {34656#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:26,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {34657#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:26,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {34657#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:26,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {34658#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:26,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {34658#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:26,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {34659#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:26,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {34659#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:26,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {34660#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:26,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {34660#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:26,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {34661#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:26,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {34661#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:26,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {34662#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:26,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {34662#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:26,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {34663#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:26,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {34663#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:26,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {34664#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:26,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {34664#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:26,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {34665#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:26,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {34665#(<= main_~i~1 9)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:26,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {34666#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:26,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {34666#(<= main_~i~1 10)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:26,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {34667#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:26,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {34667#(<= main_~i~1 11)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:26,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {34668#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:26,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {34668#(<= main_~i~1 12)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:26,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {34669#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:26,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {34669#(<= main_~i~1 13)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:26,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {34670#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:26,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {34670#(<= main_~i~1 14)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:26,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {34671#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:26,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {34671#(<= main_~i~1 15)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:26,588 INFO L273 TraceCheckUtils]: 38: Hoare triple {34672#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:26,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {34672#(<= main_~i~1 16)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:26,590 INFO L273 TraceCheckUtils]: 40: Hoare triple {34673#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:26,590 INFO L273 TraceCheckUtils]: 41: Hoare triple {34673#(<= main_~i~1 17)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:26,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {34674#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:26,592 INFO L273 TraceCheckUtils]: 43: Hoare triple {34674#(<= main_~i~1 18)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:26,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {34675#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:26,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {34675#(<= main_~i~1 19)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:26,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {34676#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:26,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {34676#(<= main_~i~1 20)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:26,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {34677#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:26,595 INFO L273 TraceCheckUtils]: 49: Hoare triple {34677#(<= main_~i~1 21)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:26,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {34678#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:26,597 INFO L273 TraceCheckUtils]: 51: Hoare triple {34678#(<= main_~i~1 22)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:26,597 INFO L273 TraceCheckUtils]: 52: Hoare triple {34679#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:26,598 INFO L273 TraceCheckUtils]: 53: Hoare triple {34679#(<= main_~i~1 23)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:26,598 INFO L273 TraceCheckUtils]: 54: Hoare triple {34680#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:26,599 INFO L273 TraceCheckUtils]: 55: Hoare triple {34680#(<= main_~i~1 24)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:26,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {34681#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:26,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {34681#(<= main_~i~1 25)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:26,601 INFO L273 TraceCheckUtils]: 58: Hoare triple {34682#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:26,602 INFO L273 TraceCheckUtils]: 59: Hoare triple {34682#(<= main_~i~1 26)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:26,602 INFO L273 TraceCheckUtils]: 60: Hoare triple {34683#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:26,603 INFO L273 TraceCheckUtils]: 61: Hoare triple {34683#(<= main_~i~1 27)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:26,603 INFO L273 TraceCheckUtils]: 62: Hoare triple {34684#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:26,604 INFO L273 TraceCheckUtils]: 63: Hoare triple {34684#(<= main_~i~1 28)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:26,605 INFO L273 TraceCheckUtils]: 64: Hoare triple {34685#(<= main_~i~1 29)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:26,605 INFO L273 TraceCheckUtils]: 65: Hoare triple {34685#(<= main_~i~1 29)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:26,606 INFO L273 TraceCheckUtils]: 66: Hoare triple {34686#(<= main_~i~1 30)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:26,607 INFO L273 TraceCheckUtils]: 67: Hoare triple {34686#(<= main_~i~1 30)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:26,607 INFO L273 TraceCheckUtils]: 68: Hoare triple {34687#(<= main_~i~1 31)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:26,608 INFO L273 TraceCheckUtils]: 69: Hoare triple {34687#(<= main_~i~1 31)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:26,608 INFO L273 TraceCheckUtils]: 70: Hoare triple {34688#(<= main_~i~1 32)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:26,609 INFO L273 TraceCheckUtils]: 71: Hoare triple {34688#(<= main_~i~1 32)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:26,610 INFO L273 TraceCheckUtils]: 72: Hoare triple {34689#(<= main_~i~1 33)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:26,610 INFO L273 TraceCheckUtils]: 73: Hoare triple {34689#(<= main_~i~1 33)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:26,611 INFO L273 TraceCheckUtils]: 74: Hoare triple {34690#(<= main_~i~1 34)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:26,612 INFO L273 TraceCheckUtils]: 75: Hoare triple {34690#(<= main_~i~1 34)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:26,612 INFO L273 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~1 35)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:26,613 INFO L273 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~1 35)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:26,613 INFO L273 TraceCheckUtils]: 78: Hoare triple {34692#(<= main_~i~1 36)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:30:26,614 INFO L273 TraceCheckUtils]: 79: Hoare triple {34692#(<= main_~i~1 36)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:26,615 INFO L273 TraceCheckUtils]: 80: Hoare triple {34693#(<= main_~i~1 37)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:30:26,615 INFO L273 TraceCheckUtils]: 81: Hoare triple {34693#(<= main_~i~1 37)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:26,616 INFO L273 TraceCheckUtils]: 82: Hoare triple {34694#(<= main_~i~1 38)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:30:26,617 INFO L273 TraceCheckUtils]: 83: Hoare triple {34694#(<= main_~i~1 38)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {34695#(<= main_~i~1 39)} is VALID [2018-11-23 12:30:26,617 INFO L273 TraceCheckUtils]: 84: Hoare triple {34695#(<= main_~i~1 39)} assume !(~i~1 < 1000); {34655#false} is VALID [2018-11-23 12:30:26,617 INFO L256 TraceCheckUtils]: 85: Hoare triple {34655#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:30:26,618 INFO L273 TraceCheckUtils]: 86: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34654#true} is VALID [2018-11-23 12:30:26,618 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,618 INFO L273 TraceCheckUtils]: 88: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,618 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,618 INFO L273 TraceCheckUtils]: 90: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 92: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 94: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,619 INFO L273 TraceCheckUtils]: 96: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 98: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 100: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,620 INFO L273 TraceCheckUtils]: 102: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,621 INFO L273 TraceCheckUtils]: 104: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,621 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,621 INFO L273 TraceCheckUtils]: 106: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,621 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 110: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 112: Hoare triple {34654#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34655#false} #70#return; {34655#false} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 115: Hoare triple {34655#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:30:26,622 INFO L256 TraceCheckUtils]: 116: Hoare triple {34655#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:30:26,622 INFO L273 TraceCheckUtils]: 117: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 119: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 121: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 123: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 125: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,623 INFO L273 TraceCheckUtils]: 127: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 129: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 131: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 133: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 135: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,624 INFO L273 TraceCheckUtils]: 137: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 139: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 141: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 143: Hoare triple {34654#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:30:26,625 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34655#false} #72#return; {34655#false} is VALID [2018-11-23 12:30:26,625 INFO L273 TraceCheckUtils]: 146: Hoare triple {34655#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 147: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 148: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 149: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 150: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 151: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 152: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 153: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 154: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 155: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,626 INFO L273 TraceCheckUtils]: 156: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 157: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 158: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 159: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 160: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 161: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 162: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 163: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 164: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,627 INFO L273 TraceCheckUtils]: 165: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 166: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 167: Hoare triple {34655#false} assume !!(~i~2 < 999);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 168: Hoare triple {34655#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 169: Hoare triple {34655#false} assume !(~i~2 < 999); {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 170: Hoare triple {34655#false} call write~int(~temp~0, ~#x~0.base, 3996 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:30:26,628 INFO L256 TraceCheckUtils]: 171: Hoare triple {34655#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 172: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34654#true} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 173: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 174: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,628 INFO L273 TraceCheckUtils]: 175: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 176: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 177: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 178: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 179: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 180: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 181: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 182: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 183: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 184: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,629 INFO L273 TraceCheckUtils]: 185: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 186: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 187: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 188: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 189: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 190: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 191: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 192: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 193: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 194: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,630 INFO L273 TraceCheckUtils]: 195: Hoare triple {34654#true} assume !!(~i~0 < 1000);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + ~i~0 + #t~mem1;havoc #t~mem1; {34654#true} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 196: Hoare triple {34654#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34654#true} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 197: Hoare triple {34654#true} assume !(~i~0 < 1000); {34654#true} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 198: Hoare triple {34654#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 199: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:30:26,631 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34654#true} {34655#false} #74#return; {34655#false} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 201: Hoare triple {34655#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {34655#false} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 202: Hoare triple {34655#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {34655#false} is VALID [2018-11-23 12:30:26,631 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:30:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:30:26,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:26,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:30:26,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:30:27,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:30:27,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:27,237 INFO L273 TraceCheckSpWp]: Computing forward predicates...