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/reducercommutativity/rangesum10_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:13:14,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:13:14,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:13:14,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:13:14,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:13:14,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:13:14,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:13:14,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:13:14,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:13:14,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:13:14,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:13:14,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:13:14,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:13:14,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:13:14,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:13:14,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:13:14,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:13:14,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:13:14,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:13:14,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:13:14,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:13:14,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:13:14,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:13:14,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:13:14,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:13:14,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:13:14,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:13:14,232 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:13:14,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:13:14,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:13:14,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:13:14,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:13:14,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:13:14,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:13:14,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:13:14,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:13:14,239 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:13:14,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:13:14,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:13:14,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:13:14,256 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:13:14,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:13:14,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:13:14,257 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:13:14,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:13:14,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:13:14,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:13:14,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:13:14,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:13:14,259 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:13:14,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:13:14,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:13:14,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:13:14,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:13:14,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:13:14,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:14,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:13:14,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:13:14,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:13:14,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:13:14,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:13:14,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:13:14,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:13:14,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:13:14,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:13:14,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:13:14,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:13:14,320 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:13:14,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-23 12:13:14,377 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd2a7c5a/73b08c7027a941e99f2f9022659a8661/FLAGda30261cf [2018-11-23 12:13:14,825 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:13:14,826 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-23 12:13:14,833 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd2a7c5a/73b08c7027a941e99f2f9022659a8661/FLAGda30261cf [2018-11-23 12:13:15,180 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd2a7c5a/73b08c7027a941e99f2f9022659a8661 [2018-11-23 12:13:15,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:13:15,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:13:15,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:15,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:13:15,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:13:15,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431c9016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15, skipping insertion in model container [2018-11-23 12:13:15,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:13:15,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:13:15,466 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:15,480 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:13:15,514 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:15,533 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:13:15,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15 WrapperNode [2018-11-23 12:13:15,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:15,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:15,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:13:15,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:13:15,546 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:13:15" (1/1) ... [2018-11-23 12:13:15,556 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:13:15" (1/1) ... [2018-11-23 12:13:15,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:15,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:13:15,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:13:15,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:13:15,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (1/1) ... [2018-11-23 12:13:15,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:13:15,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:13:15,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:13:15,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:13:15,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13: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:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:13:15,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:13:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:13:15,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:13:15,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:13:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 12:13:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 12:13:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:13:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 12:13:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 12:13:16,667 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:13:16,668 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:13:16,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:16 BoogieIcfgContainer [2018-11-23 12:13:16,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:13:16,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:13:16,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:13:16,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:13:16,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:13:15" (1/3) ... [2018-11-23 12:13:16,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f5f0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:16, skipping insertion in model container [2018-11-23 12:13:16,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:15" (2/3) ... [2018-11-23 12:13:16,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f5f0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:16, skipping insertion in model container [2018-11-23 12:13:16,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:16" (3/3) ... [2018-11-23 12:13:16,676 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10_false-unreach-call_true-termination.i [2018-11-23 12:13:16,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:13:16,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:13:16,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:13:16,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:13:16,747 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:13:16,747 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:13:16,747 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:13:16,748 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:13:16,748 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:13:16,748 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:13:16,748 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:13:16,749 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:13:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 12:13:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:16,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:16,778 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, 1, 1, 1] [2018-11-23 12:13:16,781 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:16,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 12:13:16,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:16,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:16,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:16,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:16,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 12:13:16,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:16,936 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:13:16,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:17,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:17,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 12:13:17,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 12:13:17,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:17,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #78#return; {40#true} is VALID [2018-11-23 12:13:17,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2018-11-23 12:13:17,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {40#true} is VALID [2018-11-23 12:13:17,179 INFO L256 TraceCheckUtils]: 6: Hoare triple {40#true} call init_nondet(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:17,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {40#true} is VALID [2018-11-23 12:13:17,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#true} assume !(~i~0 < 10); {40#true} is VALID [2018-11-23 12:13:17,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 12:13:17,181 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #82#return; {40#true} is VALID [2018-11-23 12:13:17,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {40#true} is VALID [2018-11-23 12:13:17,181 INFO L256 TraceCheckUtils]: 12: Hoare triple {40#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {40#true} is VALID [2018-11-23 12:13:17,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {40#true} is VALID [2018-11-23 12:13:17,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 12:13:17,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2018-11-23 12:13:17,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:17,194 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {41#false} {40#true} #84#return; {41#false} is VALID [2018-11-23 12:13:17,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {41#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {41#false} is VALID [2018-11-23 12:13:17,195 INFO L256 TraceCheckUtils]: 19: Hoare triple {41#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:17,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {41#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {41#false} is VALID [2018-11-23 12:13:17,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:17,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2018-11-23 12:13:17,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:17,197 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {41#false} {41#false} #86#return; {41#false} is VALID [2018-11-23 12:13:17,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {41#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {41#false} is VALID [2018-11-23 12:13:17,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {41#false} assume !(~i~2 < 9); {41#false} is VALID [2018-11-23 12:13:17,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {41#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {41#false} is VALID [2018-11-23 12:13:17,198 INFO L256 TraceCheckUtils]: 28: Hoare triple {41#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {41#false} is VALID [2018-11-23 12:13:17,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {41#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {41#false} is VALID [2018-11-23 12:13:17,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 12:13:17,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {41#false} is VALID [2018-11-23 12:13:17,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-23 12:13:17,200 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {41#false} {41#false} #88#return; {41#false} is VALID [2018-11-23 12:13:17,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {41#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {41#false} is VALID [2018-11-23 12:13:17,201 INFO L273 TraceCheckUtils]: 35: Hoare triple {41#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {41#false} is VALID [2018-11-23 12:13:17,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 12:13:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 12:13:17,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:17,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:13:17,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:17,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:17,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:13:17,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:13:17,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:13:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:17,486 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 12:13:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:17,809 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-23 12:13:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:13:17,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:13:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:13:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 12:13:17,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2018-11-23 12:13:18,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:18,466 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:13:18,467 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:13:18,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 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:13:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:13:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:13:18,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:18,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:18,518 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:18,519 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:18,527 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:18,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:18,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:18,529 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:18,529 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:13:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:18,535 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 12:13:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:18,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:18,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:18,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:18,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:13:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:13:18,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2018-11-23 12:13:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:18,543 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:13:18,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:13:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:13:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:13:18,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:18,546 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, 1, 1, 1] [2018-11-23 12:13:18,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:18,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2018-11-23 12:13:18,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:18,564 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:18,564 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:18,565 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:18,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:18,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2018-11-23 12:13:18,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {344#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {344#true} is VALID [2018-11-23 12:13:18,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2018-11-23 12:13:18,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #78#return; {344#true} is VALID [2018-11-23 12:13:18,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret12 := main(); {344#true} is VALID [2018-11-23 12:13:18,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {344#true} is VALID [2018-11-23 12:13:18,980 INFO L256 TraceCheckUtils]: 6: Hoare triple {344#true} call init_nondet(~#x~0.base, ~#x~0.offset); {344#true} is VALID [2018-11-23 12:13:18,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {370#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:18,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= init_nondet_~i~0 0)} assume !(~i~0 < 10); {345#false} is VALID [2018-11-23 12:13:18,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,986 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {345#false} {344#true} #82#return; {345#false} is VALID [2018-11-23 12:13:18,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {345#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {345#false} is VALID [2018-11-23 12:13:18,987 INFO L256 TraceCheckUtils]: 12: Hoare triple {345#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2018-11-23 12:13:18,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {345#false} assume !(~i~1 < 10); {345#false} is VALID [2018-11-23 12:13:18,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2018-11-23 12:13:18,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,989 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {345#false} {345#false} #84#return; {345#false} is VALID [2018-11-23 12:13:18,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {345#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {345#false} is VALID [2018-11-23 12:13:18,989 INFO L256 TraceCheckUtils]: 19: Hoare triple {345#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,990 INFO L273 TraceCheckUtils]: 20: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2018-11-23 12:13:18,990 INFO L273 TraceCheckUtils]: 21: Hoare triple {345#false} assume !(~i~1 < 10); {345#false} is VALID [2018-11-23 12:13:18,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2018-11-23 12:13:18,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,991 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {345#false} {345#false} #86#return; {345#false} is VALID [2018-11-23 12:13:18,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {345#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {345#false} is VALID [2018-11-23 12:13:18,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {345#false} assume !(~i~2 < 9); {345#false} is VALID [2018-11-23 12:13:18,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {345#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {345#false} is VALID [2018-11-23 12:13:18,992 INFO L256 TraceCheckUtils]: 28: Hoare triple {345#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {345#false} is VALID [2018-11-23 12:13:18,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {345#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {345#false} is VALID [2018-11-23 12:13:18,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {345#false} assume !(~i~1 < 10); {345#false} is VALID [2018-11-23 12:13:18,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {345#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {345#false} is VALID [2018-11-23 12:13:18,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {345#false} assume true; {345#false} is VALID [2018-11-23 12:13:18,994 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {345#false} {345#false} #88#return; {345#false} is VALID [2018-11-23 12:13:18,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {345#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {345#false} is VALID [2018-11-23 12:13:18,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {345#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {345#false} is VALID [2018-11-23 12:13:18,995 INFO L273 TraceCheckUtils]: 36: Hoare triple {345#false} assume !false; {345#false} is VALID [2018-11-23 12:13:18,998 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:13:19,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:19,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:19,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:19,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:19,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:19,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:19,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:19,064 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 12:13:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,287 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 12:13:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:19,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 12:13:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:19,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:19,484 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:13:19,486 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:13:19,486 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:13:19,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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:13:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:13:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:13:19,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:19,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:19,508 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:19,508 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:13:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,512 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:19,513 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:19,514 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:13:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:19,517 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 12:13:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:13:19,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:19,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:19,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:19,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:13:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 12:13:19,522 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 12:13:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:19,522 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 12:13:19,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:13:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:19,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:19,525 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:19,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:19,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 12:13:19,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:19,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:19,545 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:19,545 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:19,546 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:19,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:19,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:19,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2018-11-23 12:13:19,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {648#true} is VALID [2018-11-23 12:13:19,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:19,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #78#return; {648#true} is VALID [2018-11-23 12:13:19,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret12 := main(); {648#true} is VALID [2018-11-23 12:13:19,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {648#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {648#true} is VALID [2018-11-23 12:13:19,707 INFO L256 TraceCheckUtils]: 6: Hoare triple {648#true} call init_nondet(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {648#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {648#true} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {648#true} is VALID [2018-11-23 12:13:19,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {648#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {648#true} is VALID [2018-11-23 12:13:19,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#true} assume !(~i~0 < 10); {648#true} is VALID [2018-11-23 12:13:19,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 12:13:19,708 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {648#true} {648#true} #82#return; {648#true} is VALID [2018-11-23 12:13:19,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {648#true} is VALID [2018-11-23 12:13:19,709 INFO L256 TraceCheckUtils]: 14: Hoare triple {648#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {648#true} is VALID [2018-11-23 12:13:19,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {648#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {698#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:19,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#(= 0 rangesum_~cnt~0)} assume !(~i~1 < 10); {698#(= 0 rangesum_~cnt~0)} is VALID [2018-11-23 12:13:19,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {698#(= 0 rangesum_~cnt~0)} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2018-11-23 12:13:19,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,715 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {649#false} {648#true} #84#return; {649#false} is VALID [2018-11-23 12:13:19,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {649#false} is VALID [2018-11-23 12:13:19,716 INFO L256 TraceCheckUtils]: 21: Hoare triple {649#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:19,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {649#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {649#false} is VALID [2018-11-23 12:13:19,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {649#false} assume !(~i~1 < 10); {649#false} is VALID [2018-11-23 12:13:19,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {649#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2018-11-23 12:13:19,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,717 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {649#false} {649#false} #86#return; {649#false} is VALID [2018-11-23 12:13:19,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {649#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {649#false} is VALID [2018-11-23 12:13:19,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {649#false} assume !(~i~2 < 9); {649#false} is VALID [2018-11-23 12:13:19,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {649#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {649#false} is VALID [2018-11-23 12:13:19,718 INFO L256 TraceCheckUtils]: 30: Hoare triple {649#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {649#false} is VALID [2018-11-23 12:13:19,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {649#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {649#false} is VALID [2018-11-23 12:13:19,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {649#false} assume !(~i~1 < 10); {649#false} is VALID [2018-11-23 12:13:19,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {649#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {649#false} is VALID [2018-11-23 12:13:19,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {649#false} assume true; {649#false} is VALID [2018-11-23 12:13:19,720 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {649#false} {649#false} #88#return; {649#false} is VALID [2018-11-23 12:13:19,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {649#false} is VALID [2018-11-23 12:13:19,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {649#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {649#false} is VALID [2018-11-23 12:13:19,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#false} assume !false; {649#false} is VALID [2018-11-23 12:13:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:13:19,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:19,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:13:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:19,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:19,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:13:19,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:19,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:13:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:13:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:13:19,839 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-23 12:13:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,035 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 12:13:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:20,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:13:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:13:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:13:20,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 12:13:20,152 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:13:20,155 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:13:20,156 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:13:20,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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:13:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:13:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:13:20,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:20,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:20,179 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:20,179 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:13:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,184 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:20,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:20,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:20,185 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:20,186 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:13:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,189 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-23 12:13:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 12:13:20,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:20,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:20,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:20,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:20,194 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 39 [2018-11-23 12:13:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:20,195 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:20,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:13:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:13:20,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:20,197 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:20,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash -22870507, now seen corresponding path program 1 times [2018-11-23 12:13:20,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:20,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:20,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:20,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:20,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {974#true} is VALID [2018-11-23 12:13:20,324 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:20,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:20,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:20,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 10); {974#true} is VALID [2018-11-23 12:13:20,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,326 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:20,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:20,326 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {976#(= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:20,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {976#(= rangesum_~i~1 0)} assume !(~i~1 < 10); {975#false} is VALID [2018-11-23 12:13:20,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:20,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:20,349 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:20,349 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:20,349 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {974#true} is VALID [2018-11-23 12:13:20,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {974#true} assume !(~i~1 < 10); {974#true} is VALID [2018-11-23 12:13:20,350 INFO L273 TraceCheckUtils]: 24: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:20,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,351 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {974#true} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:20,351 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {975#false} is VALID [2018-11-23 12:13:20,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 9); {975#false} is VALID [2018-11-23 12:13:20,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:20,352 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {974#true} is VALID [2018-11-23 12:13:20,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {974#true} assume !(~i~1 < 10); {974#true} is VALID [2018-11-23 12:13:20,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {974#true} assume !(0 != ~cnt~0);#res := 0; {974#true} is VALID [2018-11-23 12:13:20,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,353 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {974#true} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:20,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:20,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:20,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:20,357 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:13:20,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:20,358 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:13:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:20,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:20,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 12:13:20,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {974#true} is VALID [2018-11-23 12:13:20,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #78#return; {974#true} is VALID [2018-11-23 12:13:20,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret12 := main(); {974#true} is VALID [2018-11-23 12:13:20,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {974#true} is VALID [2018-11-23 12:13:20,553 INFO L256 TraceCheckUtils]: 6: Hoare triple {974#true} call init_nondet(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {974#true} is VALID [2018-11-23 12:13:20,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {974#true} is VALID [2018-11-23 12:13:20,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {974#true} is VALID [2018-11-23 12:13:20,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#true} assume !(~i~0 < 10); {974#true} is VALID [2018-11-23 12:13:20,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 12:13:20,555 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {974#true} {974#true} #82#return; {974#true} is VALID [2018-11-23 12:13:20,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {974#true} is VALID [2018-11-23 12:13:20,555 INFO L256 TraceCheckUtils]: 14: Hoare triple {974#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {974#true} is VALID [2018-11-23 12:13:20,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1025#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:20,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#(<= rangesum_~i~1 0)} assume !(~i~1 < 10); {975#false} is VALID [2018-11-23 12:13:20,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:20,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:20,558 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {975#false} {974#true} #84#return; {975#false} is VALID [2018-11-23 12:13:20,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {975#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:20,559 INFO L256 TraceCheckUtils]: 21: Hoare triple {975#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:20,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {975#false} is VALID [2018-11-23 12:13:20,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {975#false} assume !(~i~1 < 10); {975#false} is VALID [2018-11-23 12:13:20,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:20,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:20,560 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {975#false} {975#false} #86#return; {975#false} is VALID [2018-11-23 12:13:20,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {975#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {975#false} is VALID [2018-11-23 12:13:20,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {975#false} assume !(~i~2 < 9); {975#false} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 29: Hoare triple {975#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {975#false} is VALID [2018-11-23 12:13:20,561 INFO L256 TraceCheckUtils]: 30: Hoare triple {975#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {975#false} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {975#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {975#false} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {975#false} assume !(~i~1 < 10); {975#false} is VALID [2018-11-23 12:13:20,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {975#false} assume !(0 != ~cnt~0);#res := 0; {975#false} is VALID [2018-11-23 12:13:20,562 INFO L273 TraceCheckUtils]: 34: Hoare triple {975#false} assume true; {975#false} is VALID [2018-11-23 12:13:20,562 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {975#false} {975#false} #88#return; {975#false} is VALID [2018-11-23 12:13:20,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {975#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {975#false} is VALID [2018-11-23 12:13:20,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {975#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {975#false} is VALID [2018-11-23 12:13:20,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 12:13:20,565 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:13:20,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:20,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:13:20,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:20,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:20,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:20,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:20,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:20,671 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:20,910 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 12:13:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:13:20,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 12:13:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 12:13:20,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 12:13:21,039 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:13:21,042 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:13:21,042 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:21,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:13:21,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:21,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:21,079 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:21,080 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:13:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:21,082 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:21,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:21,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:21,084 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:21,084 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:13:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:21,087 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 12:13:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:13:21,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:21,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:21,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:21,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:13:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:13:21,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 39 [2018-11-23 12:13:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:21,092 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:13:21,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:13:21,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:13:21,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:21,094 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-23 12:13:21,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:21,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 12:13:21,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:21,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:21,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:21,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:21,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:21,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:21,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:21,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:21,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {1313#true} is VALID [2018-11-23 12:13:21,199 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:21,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:21,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:21,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 10); {1313#true} is VALID [2018-11-23 12:13:21,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,200 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:21,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:21,201 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1313#true} is VALID [2018-11-23 12:13:21,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 5); {1315#(<= rangesum_~i~1 5)} is VALID [2018-11-23 12:13:21,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= rangesum_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1316#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:21,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#(<= rangesum_~i~1 6)} assume !(~i~1 < 10); {1314#false} is VALID [2018-11-23 12:13:21,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:21,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:21,210 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1314#false} {1313#true} #84#return; {1314#false} is VALID [2018-11-23 12:13:21,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {1314#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:21,210 INFO L256 TraceCheckUtils]: 24: Hoare triple {1314#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1313#true} is VALID [2018-11-23 12:13:21,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 5); {1313#true} is VALID [2018-11-23 12:13:21,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,212 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,212 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1314#false} #86#return; {1314#false} is VALID [2018-11-23 12:13:21,212 INFO L273 TraceCheckUtils]: 33: Hoare triple {1314#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1314#false} is VALID [2018-11-23 12:13:21,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {1314#false} assume !(~i~2 < 9); {1314#false} is VALID [2018-11-23 12:13:21,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:21,213 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1313#true} is VALID [2018-11-23 12:13:21,213 INFO L273 TraceCheckUtils]: 38: Hoare triple {1313#true} assume !!(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,213 INFO L273 TraceCheckUtils]: 39: Hoare triple {1313#true} assume !(~i~1 > 5); {1313#true} is VALID [2018-11-23 12:13:21,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,214 INFO L273 TraceCheckUtils]: 41: Hoare triple {1313#true} assume !(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,214 INFO L273 TraceCheckUtils]: 42: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,215 INFO L273 TraceCheckUtils]: 43: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,215 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1313#true} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:21,215 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:21,215 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:21,215 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:13:21,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:13:21,219 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:13:21,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:21,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:21,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {1313#true} call ULTIMATE.init(); {1313#true} is VALID [2018-11-23 12:13:21,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {1313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1313#true} is VALID [2018-11-23 12:13:21,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1313#true} {1313#true} #78#return; {1313#true} is VALID [2018-11-23 12:13:21,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {1313#true} call #t~ret12 := main(); {1313#true} is VALID [2018-11-23 12:13:21,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {1313#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {1313#true} is VALID [2018-11-23 12:13:21,779 INFO L256 TraceCheckUtils]: 6: Hoare triple {1313#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1313#true} is VALID [2018-11-23 12:13:21,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1313#true} is VALID [2018-11-23 12:13:21,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1313#true} is VALID [2018-11-23 12:13:21,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#true} assume !(~i~0 < 10); {1313#true} is VALID [2018-11-23 12:13:21,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,781 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1313#true} {1313#true} #82#return; {1313#true} is VALID [2018-11-23 12:13:21,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {1313#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1313#true} is VALID [2018-11-23 12:13:21,782 INFO L256 TraceCheckUtils]: 14: Hoare triple {1313#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1313#true} is VALID [2018-11-23 12:13:21,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {1313#true} assume !!(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {1313#true} assume !(~i~1 > 5); {1313#true} is VALID [2018-11-23 12:13:21,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {1313#true} assume !(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,784 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1313#true} {1313#true} #84#return; {1313#true} is VALID [2018-11-23 12:13:21,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {1313#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); {1313#true} is VALID [2018-11-23 12:13:21,785 INFO L256 TraceCheckUtils]: 24: Hoare triple {1313#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1313#true} is VALID [2018-11-23 12:13:21,785 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1313#true} is VALID [2018-11-23 12:13:21,785 INFO L273 TraceCheckUtils]: 26: Hoare triple {1313#true} assume !!(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {1313#true} assume !(~i~1 > 5); {1313#true} is VALID [2018-11-23 12:13:21,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {1313#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1313#true} is VALID [2018-11-23 12:13:21,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {1313#true} assume !(~i~1 < 10); {1313#true} is VALID [2018-11-23 12:13:21,786 INFO L273 TraceCheckUtils]: 30: Hoare triple {1313#true} assume !(0 != ~cnt~0);#res := 0; {1313#true} is VALID [2018-11-23 12:13:21,786 INFO L273 TraceCheckUtils]: 31: Hoare triple {1313#true} assume true; {1313#true} is VALID [2018-11-23 12:13:21,787 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1313#true} {1313#true} #86#return; {1313#true} is VALID [2018-11-23 12:13:21,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {1313#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; {1419#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:21,820 INFO L273 TraceCheckUtils]: 34: Hoare triple {1419#(<= main_~i~2 0)} assume !(~i~2 < 9); {1314#false} is VALID [2018-11-23 12:13:21,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {1314#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1314#false} is VALID [2018-11-23 12:13:21,821 INFO L256 TraceCheckUtils]: 36: Hoare triple {1314#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1314#false} is VALID [2018-11-23 12:13:21,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {1314#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1314#false} is VALID [2018-11-23 12:13:21,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {1314#false} assume !!(~i~1 < 10); {1314#false} is VALID [2018-11-23 12:13:21,822 INFO L273 TraceCheckUtils]: 39: Hoare triple {1314#false} assume !(~i~1 > 5); {1314#false} is VALID [2018-11-23 12:13:21,822 INFO L273 TraceCheckUtils]: 40: Hoare triple {1314#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1314#false} is VALID [2018-11-23 12:13:21,822 INFO L273 TraceCheckUtils]: 41: Hoare triple {1314#false} assume !(~i~1 < 10); {1314#false} is VALID [2018-11-23 12:13:21,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {1314#false} assume !(0 != ~cnt~0);#res := 0; {1314#false} is VALID [2018-11-23 12:13:21,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {1314#false} assume true; {1314#false} is VALID [2018-11-23 12:13:21,823 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1314#false} {1314#false} #88#return; {1314#false} is VALID [2018-11-23 12:13:21,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {1314#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1314#false} is VALID [2018-11-23 12:13:21,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {1314#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1314#false} is VALID [2018-11-23 12:13:21,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {1314#false} assume !false; {1314#false} is VALID [2018-11-23 12:13:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 12:13:21,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:21,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-23 12:13:21,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:21,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:21,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:21,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:21,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:21,944 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2018-11-23 12:13:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,182 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 12:13:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:22,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:13:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:13:22,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:13:22,318 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:13:22,321 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:22,321 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:13:22,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:13:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 12:13:22,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:22,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:22,354 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:22,354 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 38 states. [2018-11-23 12:13:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,357 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:22,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:22,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:22,358 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:22,359 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 44 states. [2018-11-23 12:13:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,362 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:13:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:13:22,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:22,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:22,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:22,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:13:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 12:13:22,366 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 48 [2018-11-23 12:13:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:22,366 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 12:13:22,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:13:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:13:22,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:22,368 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:22,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:22,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1681907214, now seen corresponding path program 1 times [2018-11-23 12:13:22,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:22,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:22,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:22,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:22,386 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:22,386 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:22,386 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:22,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:22,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:22,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1697#true} is VALID [2018-11-23 12:13:22,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {1697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1697#true} is VALID [2018-11-23 12:13:22,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2018-11-23 12:13:22,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #78#return; {1697#true} is VALID [2018-11-23 12:13:22,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret12 := main(); {1697#true} is VALID [2018-11-23 12:13:22,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {1697#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {1697#true} is VALID [2018-11-23 12:13:22,614 INFO L256 TraceCheckUtils]: 6: Hoare triple {1697#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1697#true} is VALID [2018-11-23 12:13:22,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {1697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {1723#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {1723#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:22,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {1723#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1730#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:22,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {1730#(<= init_nondet_~i~0 1)} assume !(~i~0 < 10); {1698#false} is VALID [2018-11-23 12:13:22,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,616 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1698#false} {1697#true} #82#return; {1698#false} is VALID [2018-11-23 12:13:22,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {1698#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:22,617 INFO L256 TraceCheckUtils]: 14: Hoare triple {1698#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {1698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1698#false} is VALID [2018-11-23 12:13:22,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {1698#false} assume !(~i~1 > 5); {1698#false} is VALID [2018-11-23 12:13:22,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {1698#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {1698#false} assume !(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {1698#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1698#false} is VALID [2018-11-23 12:13:22,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,620 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1698#false} {1698#false} #84#return; {1698#false} is VALID [2018-11-23 12:13:22,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {1698#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1698#false} is VALID [2018-11-23 12:13:22,621 INFO L256 TraceCheckUtils]: 27: Hoare triple {1698#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,621 INFO L273 TraceCheckUtils]: 28: Hoare triple {1698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1698#false} is VALID [2018-11-23 12:13:22,621 INFO L273 TraceCheckUtils]: 29: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,621 INFO L273 TraceCheckUtils]: 30: Hoare triple {1698#false} assume !(~i~1 > 5); {1698#false} is VALID [2018-11-23 12:13:22,622 INFO L273 TraceCheckUtils]: 31: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,622 INFO L273 TraceCheckUtils]: 33: Hoare triple {1698#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,623 INFO L273 TraceCheckUtils]: 35: Hoare triple {1698#false} assume !(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {1698#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1698#false} is VALID [2018-11-23 12:13:22,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,623 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1698#false} {1698#false} #86#return; {1698#false} is VALID [2018-11-23 12:13:22,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {1698#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1698#false} is VALID [2018-11-23 12:13:22,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {1698#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1698#false} is VALID [2018-11-23 12:13:22,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {1698#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1698#false} is VALID [2018-11-23 12:13:22,624 INFO L273 TraceCheckUtils]: 42: Hoare triple {1698#false} assume !(~i~2 < 9); {1698#false} is VALID [2018-11-23 12:13:22,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {1698#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1698#false} is VALID [2018-11-23 12:13:22,625 INFO L256 TraceCheckUtils]: 44: Hoare triple {1698#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1698#false} is VALID [2018-11-23 12:13:22,625 INFO L273 TraceCheckUtils]: 45: Hoare triple {1698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {1698#false} is VALID [2018-11-23 12:13:22,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {1698#false} assume !(~i~1 > 5); {1698#false} is VALID [2018-11-23 12:13:22,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {1698#false} assume !!(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,626 INFO L273 TraceCheckUtils]: 50: Hoare triple {1698#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {1698#false} is VALID [2018-11-23 12:13:22,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {1698#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1698#false} is VALID [2018-11-23 12:13:22,627 INFO L273 TraceCheckUtils]: 52: Hoare triple {1698#false} assume !(~i~1 < 10); {1698#false} is VALID [2018-11-23 12:13:22,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {1698#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {1698#false} is VALID [2018-11-23 12:13:22,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {1698#false} assume true; {1698#false} is VALID [2018-11-23 12:13:22,627 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1698#false} {1698#false} #88#return; {1698#false} is VALID [2018-11-23 12:13:22,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {1698#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1698#false} is VALID [2018-11-23 12:13:22,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {1698#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1698#false} is VALID [2018-11-23 12:13:22,628 INFO L273 TraceCheckUtils]: 58: Hoare triple {1698#false} assume !false; {1698#false} is VALID [2018-11-23 12:13:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:22,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:22,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:22,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:22,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:22,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:22,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:22,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:22,689 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2018-11-23 12:13:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:22,805 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 12:13:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:22,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 12:13:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:22,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:13:22,976 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:13:22,978 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:13:22,978 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:13:22,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:13:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 12:13:23,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:23,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:23,052 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:23,053 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 12:13:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,055 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:23,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,056 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:23,056 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 12:13:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,059 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:13:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:13:23,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:23,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:13:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 12:13:23,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 59 [2018-11-23 12:13:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:23,062 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 12:13:23,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:13:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:13:23,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:23,064 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:23,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:23,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash 804630256, now seen corresponding path program 2 times [2018-11-23 12:13:23,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:23,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:23,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:23,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:23,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:23,080 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:23,081 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:23,081 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:23,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:23,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:23,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:23,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {2112#true} call ULTIMATE.init(); {2112#true} is VALID [2018-11-23 12:13:23,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {2112#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2112#true} is VALID [2018-11-23 12:13:23,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {2112#true} assume true; {2112#true} is VALID [2018-11-23 12:13:23,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2112#true} {2112#true} #78#return; {2112#true} is VALID [2018-11-23 12:13:23,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {2112#true} call #t~ret12 := main(); {2112#true} is VALID [2018-11-23 12:13:23,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {2112#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {2112#true} is VALID [2018-11-23 12:13:23,376 INFO L256 TraceCheckUtils]: 6: Hoare triple {2112#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2112#true} is VALID [2018-11-23 12:13:23,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {2112#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:23,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {2138#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2138#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:23,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:23,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {2145#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2145#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:23,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {2145#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2152#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:23,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {2152#(<= init_nondet_~i~0 2)} assume !(~i~0 < 10); {2113#false} is VALID [2018-11-23 12:13:23,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:23,386 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2113#false} {2112#true} #82#return; {2113#false} is VALID [2018-11-23 12:13:23,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {2113#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:23,386 INFO L256 TraceCheckUtils]: 16: Hoare triple {2113#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:23,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {2113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2113#false} is VALID [2018-11-23 12:13:23,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {2113#false} assume !(~i~1 > 5); {2113#false} is VALID [2018-11-23 12:13:23,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {2113#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:23,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {2113#false} assume !(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {2113#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2113#false} is VALID [2018-11-23 12:13:23,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:23,389 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2113#false} {2113#false} #84#return; {2113#false} is VALID [2018-11-23 12:13:23,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {2113#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2113#false} is VALID [2018-11-23 12:13:23,390 INFO L256 TraceCheckUtils]: 29: Hoare triple {2113#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:23,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {2113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2113#false} is VALID [2018-11-23 12:13:23,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {2113#false} assume !(~i~1 > 5); {2113#false} is VALID [2018-11-23 12:13:23,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {2113#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:23,391 INFO L273 TraceCheckUtils]: 36: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#false} assume !(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {2113#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2113#false} is VALID [2018-11-23 12:13:23,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:23,392 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2113#false} {2113#false} #86#return; {2113#false} is VALID [2018-11-23 12:13:23,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {2113#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2113#false} is VALID [2018-11-23 12:13:23,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {2113#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2113#false} is VALID [2018-11-23 12:13:23,393 INFO L273 TraceCheckUtils]: 43: Hoare triple {2113#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2113#false} is VALID [2018-11-23 12:13:23,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {2113#false} assume !(~i~2 < 9); {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {2113#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L256 TraceCheckUtils]: 46: Hoare triple {2113#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L273 TraceCheckUtils]: 47: Hoare triple {2113#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {2113#false} assume !(~i~1 > 5); {2113#false} is VALID [2018-11-23 12:13:23,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {2113#false} assume !!(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {2113#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2113#false} is VALID [2018-11-23 12:13:23,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {2113#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2113#false} is VALID [2018-11-23 12:13:23,395 INFO L273 TraceCheckUtils]: 54: Hoare triple {2113#false} assume !(~i~1 < 10); {2113#false} is VALID [2018-11-23 12:13:23,395 INFO L273 TraceCheckUtils]: 55: Hoare triple {2113#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2113#false} is VALID [2018-11-23 12:13:23,396 INFO L273 TraceCheckUtils]: 56: Hoare triple {2113#false} assume true; {2113#false} is VALID [2018-11-23 12:13:23,396 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2113#false} {2113#false} #88#return; {2113#false} is VALID [2018-11-23 12:13:23,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {2113#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2113#false} is VALID [2018-11-23 12:13:23,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {2113#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2113#false} is VALID [2018-11-23 12:13:23,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {2113#false} assume !false; {2113#false} is VALID [2018-11-23 12:13:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:13:23,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:23,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:23,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:23,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:23,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:23,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:23,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:23,513 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 12:13:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,838 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 12:13:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:23,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 12:13:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-23 12:13:23,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-23 12:13:23,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:23,950 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:13:23,950 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:13:23,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:13:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:13:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 12:13:23,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:23,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,989 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,989 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 12:13:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,992 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:23,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,992 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:23,993 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 12:13:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:23,995 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 12:13:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:13:23,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:23,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:23,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:23,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:13:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 12:13:23,998 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 61 [2018-11-23 12:13:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:23,998 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 12:13:23,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:13:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:13:23,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:23,999 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:23,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:24,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1929644946, now seen corresponding path program 3 times [2018-11-23 12:13:24,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,016 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:24,016 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:24,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:24,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:24,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:13:24,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:24,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:24,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {2544#true} call ULTIMATE.init(); {2544#true} is VALID [2018-11-23 12:13:24,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {2544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2544#true} is VALID [2018-11-23 12:13:24,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:24,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2544#true} {2544#true} #78#return; {2544#true} is VALID [2018-11-23 12:13:24,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {2544#true} call #t~ret12 := main(); {2544#true} is VALID [2018-11-23 12:13:24,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {2544#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {2544#true} is VALID [2018-11-23 12:13:24,244 INFO L256 TraceCheckUtils]: 6: Hoare triple {2544#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:24,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {2544#true} is VALID [2018-11-23 12:13:24,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {2544#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:24,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:24,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {2544#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:24,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:24,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {2544#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {2544#true} is VALID [2018-11-23 12:13:24,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {2544#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2544#true} is VALID [2018-11-23 12:13:24,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {2544#true} assume !(~i~0 < 10); {2544#true} is VALID [2018-11-23 12:13:24,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:24,246 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2544#true} {2544#true} #82#return; {2544#true} is VALID [2018-11-23 12:13:24,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {2544#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2544#true} is VALID [2018-11-23 12:13:24,246 INFO L256 TraceCheckUtils]: 18: Hoare triple {2544#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:24,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2544#true} is VALID [2018-11-23 12:13:24,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {2544#true} assume !!(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {2544#true} assume !(~i~1 > 5); {2544#true} is VALID [2018-11-23 12:13:24,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:24,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {2544#true} assume !!(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {2544#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2544#true} is VALID [2018-11-23 12:13:24,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:24,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {2544#true} assume !(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {2544#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2544#true} is VALID [2018-11-23 12:13:24,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:24,249 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2544#true} {2544#true} #84#return; {2544#true} is VALID [2018-11-23 12:13:24,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {2544#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); {2544#true} is VALID [2018-11-23 12:13:24,249 INFO L256 TraceCheckUtils]: 31: Hoare triple {2544#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:24,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2544#true} is VALID [2018-11-23 12:13:24,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {2544#true} assume !!(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {2544#true} assume !(~i~1 > 5); {2544#true} is VALID [2018-11-23 12:13:24,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:24,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {2544#true} assume !!(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,250 INFO L273 TraceCheckUtils]: 37: Hoare triple {2544#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2544#true} is VALID [2018-11-23 12:13:24,250 INFO L273 TraceCheckUtils]: 38: Hoare triple {2544#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2544#true} is VALID [2018-11-23 12:13:24,251 INFO L273 TraceCheckUtils]: 39: Hoare triple {2544#true} assume !(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,251 INFO L273 TraceCheckUtils]: 40: Hoare triple {2544#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2544#true} is VALID [2018-11-23 12:13:24,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {2544#true} assume true; {2544#true} is VALID [2018-11-23 12:13:24,251 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2544#true} {2544#true} #86#return; {2544#true} is VALID [2018-11-23 12:13:24,251 INFO L273 TraceCheckUtils]: 43: Hoare triple {2544#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; {2544#true} is VALID [2018-11-23 12:13:24,252 INFO L273 TraceCheckUtils]: 44: Hoare triple {2544#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2544#true} is VALID [2018-11-23 12:13:24,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {2544#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2544#true} is VALID [2018-11-23 12:13:24,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {2544#true} assume !(~i~2 < 9); {2544#true} is VALID [2018-11-23 12:13:24,252 INFO L273 TraceCheckUtils]: 47: Hoare triple {2544#true} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2544#true} is VALID [2018-11-23 12:13:24,252 INFO L256 TraceCheckUtils]: 48: Hoare triple {2544#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2544#true} is VALID [2018-11-23 12:13:24,253 INFO L273 TraceCheckUtils]: 49: Hoare triple {2544#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2544#true} is VALID [2018-11-23 12:13:24,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {2544#true} assume !!(~i~1 < 10); {2544#true} is VALID [2018-11-23 12:13:24,268 INFO L273 TraceCheckUtils]: 51: Hoare triple {2544#true} assume !(~i~1 > 5); {2702#(<= rangesum_~i~1 5)} is VALID [2018-11-23 12:13:24,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {2702#(<= rangesum_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2706#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:24,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {2706#(<= rangesum_~i~1 6)} assume !!(~i~1 < 10); {2706#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:24,298 INFO L273 TraceCheckUtils]: 54: Hoare triple {2706#(<= rangesum_~i~1 6)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2706#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:24,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {2706#(<= rangesum_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2716#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:24,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {2716#(<= rangesum_~i~1 7)} assume !(~i~1 < 10); {2545#false} is VALID [2018-11-23 12:13:24,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {2545#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2545#false} is VALID [2018-11-23 12:13:24,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {2545#false} assume true; {2545#false} is VALID [2018-11-23 12:13:24,318 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2545#false} {2544#true} #88#return; {2545#false} is VALID [2018-11-23 12:13:24,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {2545#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2545#false} is VALID [2018-11-23 12:13:24,319 INFO L273 TraceCheckUtils]: 61: Hoare triple {2545#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2545#false} is VALID [2018-11-23 12:13:24,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2018-11-23 12:13:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 12:13:24,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:24,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:24,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:24,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:24,385 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:13:24,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:24,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:24,386 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-23 12:13:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,552 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-11-23 12:13:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:24,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 12:13:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:13:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 12:13:24,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 12:13:24,814 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:13:24,815 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:13:24,815 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:13:24,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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:13:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:13:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:13:24,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:24,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:24,847 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:24,847 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:13:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,850 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:13:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:13:24,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:24,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:24,851 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:13:24,851 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:13:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:24,853 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:13:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:13:24,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:24,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:24,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:24,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:13:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 12:13:24,856 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2018-11-23 12:13:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 12:13:24,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:13:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:13:24,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:24,857 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:24,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash -575638740, now seen corresponding path program 4 times [2018-11-23 12:13:24,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:24,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:24,875 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:24,876 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:24,876 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:24,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:24,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:24,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:25,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {2994#true} call ULTIMATE.init(); {2994#true} is VALID [2018-11-23 12:13:25,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {2994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2994#true} is VALID [2018-11-23 12:13:25,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {2994#true} assume true; {2994#true} is VALID [2018-11-23 12:13:25,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2994#true} {2994#true} #78#return; {2994#true} is VALID [2018-11-23 12:13:25,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {2994#true} call #t~ret12 := main(); {2994#true} is VALID [2018-11-23 12:13:25,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {2994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {2994#true} is VALID [2018-11-23 12:13:25,098 INFO L256 TraceCheckUtils]: 6: Hoare triple {2994#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2994#true} is VALID [2018-11-23 12:13:25,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {2994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3020#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:25,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {3020#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3020#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:25,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {3020#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3027#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:25,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {3027#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3027#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:25,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {3027#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3034#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:25,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {3034#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3034#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:25,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {3034#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3041#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:25,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {3041#(<= init_nondet_~i~0 3)} assume !(~i~0 < 10); {2995#false} is VALID [2018-11-23 12:13:25,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {2995#false} assume true; {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2995#false} {2994#true} #82#return; {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {2995#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L256 TraceCheckUtils]: 18: Hoare triple {2995#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {2995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {2995#false} assume !(~i~1 > 5); {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {2995#false} assume !(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {2995#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2995#false} is VALID [2018-11-23 12:13:25,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {2995#false} assume true; {2995#false} is VALID [2018-11-23 12:13:25,113 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2995#false} {2995#false} #84#return; {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {2995#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L256 TraceCheckUtils]: 34: Hoare triple {2995#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {2995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {2995#false} assume !(~i~1 > 5); {2995#false} is VALID [2018-11-23 12:13:25,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {2995#false} assume !(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {2995#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2995#false} is VALID [2018-11-23 12:13:25,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {2995#false} assume true; {2995#false} is VALID [2018-11-23 12:13:25,117 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2995#false} {2995#false} #86#return; {2995#false} is VALID [2018-11-23 12:13:25,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {2995#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2995#false} is VALID [2018-11-23 12:13:25,117 INFO L273 TraceCheckUtils]: 50: Hoare triple {2995#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2995#false} is VALID [2018-11-23 12:13:25,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {2995#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2995#false} is VALID [2018-11-23 12:13:25,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {2995#false} assume !(~i~2 < 9); {2995#false} is VALID [2018-11-23 12:13:25,118 INFO L273 TraceCheckUtils]: 53: Hoare triple {2995#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2995#false} is VALID [2018-11-23 12:13:25,118 INFO L256 TraceCheckUtils]: 54: Hoare triple {2995#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2995#false} is VALID [2018-11-23 12:13:25,119 INFO L273 TraceCheckUtils]: 55: Hoare triple {2995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {2995#false} is VALID [2018-11-23 12:13:25,119 INFO L273 TraceCheckUtils]: 56: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,119 INFO L273 TraceCheckUtils]: 57: Hoare triple {2995#false} assume !(~i~1 > 5); {2995#false} is VALID [2018-11-23 12:13:25,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {2995#false} assume !!(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {2995#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {2995#false} is VALID [2018-11-23 12:13:25,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {2995#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2995#false} is VALID [2018-11-23 12:13:25,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {2995#false} assume !(~i~1 < 10); {2995#false} is VALID [2018-11-23 12:13:25,121 INFO L273 TraceCheckUtils]: 66: Hoare triple {2995#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {2995#false} is VALID [2018-11-23 12:13:25,122 INFO L273 TraceCheckUtils]: 67: Hoare triple {2995#false} assume true; {2995#false} is VALID [2018-11-23 12:13:25,122 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2995#false} {2995#false} #88#return; {2995#false} is VALID [2018-11-23 12:13:25,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {2995#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2995#false} is VALID [2018-11-23 12:13:25,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {2995#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2995#false} is VALID [2018-11-23 12:13:25,123 INFO L273 TraceCheckUtils]: 71: Hoare triple {2995#false} assume !false; {2995#false} is VALID [2018-11-23 12:13:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-23 12:13:25,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:25,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:25,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 12:13:25,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:25,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:25,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:25,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:25,194 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2018-11-23 12:13:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,573 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-23 12:13:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:25,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 12:13:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2018-11-23 12:13:25,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2018-11-23 12:13:25,654 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:13:25,656 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:13:25,656 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:13:25,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:13:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 12:13:25,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:25,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,790 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,790 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 12:13:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,793 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:13:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 12:13:25,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:25,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:25,794 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 12:13:25,794 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 12:13:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:25,796 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:13:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 12:13:25,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:25,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:25,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:25,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:13:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-23 12:13:25,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 72 [2018-11-23 12:13:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:25,799 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-23 12:13:25,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:13:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:13:25,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:25,800 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 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, 1, 1, 1] [2018-11-23 12:13:25,801 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:25,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash -336825618, now seen corresponding path program 5 times [2018-11-23 12:13:25,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:25,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:25,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:25,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:25,828 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:25,828 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:25,829 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:25,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:25,905 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:13:25,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:25,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:26,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {3488#true} call ULTIMATE.init(); {3488#true} is VALID [2018-11-23 12:13:26,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {3488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3488#true} is VALID [2018-11-23 12:13:26,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2018-11-23 12:13:26,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #78#return; {3488#true} is VALID [2018-11-23 12:13:26,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret12 := main(); {3488#true} is VALID [2018-11-23 12:13:26,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {3488#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {3488#true} is VALID [2018-11-23 12:13:26,013 INFO L256 TraceCheckUtils]: 6: Hoare triple {3488#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3488#true} is VALID [2018-11-23 12:13:26,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {3488#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3488#true} is VALID [2018-11-23 12:13:26,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {3488#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3488#true} is VALID [2018-11-23 12:13:26,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {3488#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#true} is VALID [2018-11-23 12:13:26,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {3488#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3488#true} is VALID [2018-11-23 12:13:26,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {3488#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#true} is VALID [2018-11-23 12:13:26,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {3488#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3488#true} is VALID [2018-11-23 12:13:26,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {3488#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#true} is VALID [2018-11-23 12:13:26,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {3488#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3488#true} is VALID [2018-11-23 12:13:26,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {3488#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3488#true} is VALID [2018-11-23 12:13:26,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {3488#true} assume !(~i~0 < 10); {3488#true} is VALID [2018-11-23 12:13:26,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {3488#true} assume true; {3488#true} is VALID [2018-11-23 12:13:26,015 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3488#true} {3488#true} #82#return; {3488#true} is VALID [2018-11-23 12:13:26,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {3488#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3488#true} is VALID [2018-11-23 12:13:26,016 INFO L256 TraceCheckUtils]: 20: Hoare triple {3488#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3488#true} is VALID [2018-11-23 12:13:26,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {3488#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3488#true} is VALID [2018-11-23 12:13:26,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {3488#true} assume !!(~i~1 < 10); {3488#true} is VALID [2018-11-23 12:13:26,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {3488#true} assume !(~i~1 > 5); {3488#true} is VALID [2018-11-23 12:13:26,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {3488#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {3488#true} assume !!(~i~1 < 10); {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {3488#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {3488#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {3488#true} assume !!(~i~1 < 10); {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {3488#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3488#true} is VALID [2018-11-23 12:13:26,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {3488#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#true} is VALID [2018-11-23 12:13:26,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {3488#true} assume !(~i~1 < 10); {3488#true} is VALID [2018-11-23 12:13:26,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {3488#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3488#true} is VALID [2018-11-23 12:13:26,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {3488#true} assume true; {3488#true} is VALID [2018-11-23 12:13:26,018 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3488#true} {3488#true} #84#return; {3488#true} is VALID [2018-11-23 12:13:26,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {3488#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); {3488#true} is VALID [2018-11-23 12:13:26,019 INFO L256 TraceCheckUtils]: 36: Hoare triple {3488#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3488#true} is VALID [2018-11-23 12:13:26,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {3488#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3604#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:26,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {3604#(<= rangesum_~i~1 0)} assume !!(~i~1 < 10); {3604#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:26,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {3604#(<= rangesum_~i~1 0)} assume !(~i~1 > 5); {3604#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:26,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {3604#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3614#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:26,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {3614#(<= rangesum_~i~1 1)} assume !!(~i~1 < 10); {3614#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:26,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {3614#(<= rangesum_~i~1 1)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3489#false} is VALID [2018-11-23 12:13:26,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {3489#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {3489#false} assume !!(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {3489#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {3489#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {3489#false} assume !(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {3489#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L273 TraceCheckUtils]: 49: Hoare triple {3489#false} assume true; {3489#false} is VALID [2018-11-23 12:13:26,026 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3489#false} {3488#true} #86#return; {3489#false} is VALID [2018-11-23 12:13:26,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {3489#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3489#false} is VALID [2018-11-23 12:13:26,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {3489#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3489#false} is VALID [2018-11-23 12:13:26,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {3489#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3489#false} is VALID [2018-11-23 12:13:26,027 INFO L273 TraceCheckUtils]: 54: Hoare triple {3489#false} assume !(~i~2 < 9); {3489#false} is VALID [2018-11-23 12:13:26,027 INFO L273 TraceCheckUtils]: 55: Hoare triple {3489#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3489#false} is VALID [2018-11-23 12:13:26,028 INFO L256 TraceCheckUtils]: 56: Hoare triple {3489#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3489#false} is VALID [2018-11-23 12:13:26,028 INFO L273 TraceCheckUtils]: 57: Hoare triple {3489#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3489#false} is VALID [2018-11-23 12:13:26,028 INFO L273 TraceCheckUtils]: 58: Hoare triple {3489#false} assume !!(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,028 INFO L273 TraceCheckUtils]: 59: Hoare triple {3489#false} assume !(~i~1 > 5); {3489#false} is VALID [2018-11-23 12:13:26,028 INFO L273 TraceCheckUtils]: 60: Hoare triple {3489#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3489#false} is VALID [2018-11-23 12:13:26,029 INFO L273 TraceCheckUtils]: 61: Hoare triple {3489#false} assume !!(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,029 INFO L273 TraceCheckUtils]: 62: Hoare triple {3489#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3489#false} is VALID [2018-11-23 12:13:26,029 INFO L273 TraceCheckUtils]: 63: Hoare triple {3489#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3489#false} is VALID [2018-11-23 12:13:26,029 INFO L273 TraceCheckUtils]: 64: Hoare triple {3489#false} assume !!(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,029 INFO L273 TraceCheckUtils]: 65: Hoare triple {3489#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3489#false} is VALID [2018-11-23 12:13:26,030 INFO L273 TraceCheckUtils]: 66: Hoare triple {3489#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3489#false} is VALID [2018-11-23 12:13:26,030 INFO L273 TraceCheckUtils]: 67: Hoare triple {3489#false} assume !(~i~1 < 10); {3489#false} is VALID [2018-11-23 12:13:26,030 INFO L273 TraceCheckUtils]: 68: Hoare triple {3489#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3489#false} is VALID [2018-11-23 12:13:26,030 INFO L273 TraceCheckUtils]: 69: Hoare triple {3489#false} assume true; {3489#false} is VALID [2018-11-23 12:13:26,030 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3489#false} {3489#false} #88#return; {3489#false} is VALID [2018-11-23 12:13:26,031 INFO L273 TraceCheckUtils]: 71: Hoare triple {3489#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3489#false} is VALID [2018-11-23 12:13:26,031 INFO L273 TraceCheckUtils]: 72: Hoare triple {3489#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3489#false} is VALID [2018-11-23 12:13:26,031 INFO L273 TraceCheckUtils]: 73: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2018-11-23 12:13:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:13:26,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:26,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:26,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-23 12:13:26,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:26,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:26,113 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:13:26,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,114 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-11-23 12:13:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,266 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 12:13:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:26,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-23 12:13:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 12:13:26,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 12:13:26,447 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:13:26,448 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:13:26,448 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:13:26,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:13:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 12:13:26,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:26,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,487 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,487 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 12:13:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,489 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:13:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:13:26,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,490 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 12:13:26,490 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 12:13:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,492 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 12:13:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 12:13:26,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:26,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:26,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:26,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:13:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 12:13:26,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 74 [2018-11-23 12:13:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:26,496 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 12:13:26,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 12:13:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:13:26,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:26,497 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:26,498 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:26,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1535873938, now seen corresponding path program 6 times [2018-11-23 12:13:26,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:26,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:26,516 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:26,517 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:26,517 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:26,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:26,587 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:13:26,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:26,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:26,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {3995#true} call ULTIMATE.init(); {3995#true} is VALID [2018-11-23 12:13:26,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {3995#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3995#true} is VALID [2018-11-23 12:13:26,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {3995#true} assume true; {3995#true} is VALID [2018-11-23 12:13:26,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3995#true} {3995#true} #78#return; {3995#true} is VALID [2018-11-23 12:13:26,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {3995#true} call #t~ret12 := main(); {3995#true} is VALID [2018-11-23 12:13:26,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {3995#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {3995#true} is VALID [2018-11-23 12:13:26,723 INFO L256 TraceCheckUtils]: 6: Hoare triple {3995#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3995#true} is VALID [2018-11-23 12:13:26,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {3995#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {3995#true} is VALID [2018-11-23 12:13:26,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {3995#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3995#true} is VALID [2018-11-23 12:13:26,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {3995#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3995#true} is VALID [2018-11-23 12:13:26,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {3995#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {3995#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {3995#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {3995#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {3995#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {3995#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {3995#true} assume !(~i~0 < 10); {3995#true} is VALID [2018-11-23 12:13:26,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {3995#true} assume true; {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3995#true} {3995#true} #82#return; {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {3995#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L256 TraceCheckUtils]: 20: Hoare triple {3995#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {3995#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {3995#true} assume !(~i~1 > 5); {3995#true} is VALID [2018-11-23 12:13:26,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {3995#true} assume !(~i~1 > 5); {3995#true} is VALID [2018-11-23 12:13:26,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,726 INFO L273 TraceCheckUtils]: 28: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {3995#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3995#true} is VALID [2018-11-23 12:13:26,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {3995#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3995#true} is VALID [2018-11-23 12:13:26,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {3995#true} assume !(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {3995#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3995#true} is VALID [2018-11-23 12:13:26,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {3995#true} assume true; {3995#true} is VALID [2018-11-23 12:13:26,728 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3995#true} {3995#true} #84#return; {3995#true} is VALID [2018-11-23 12:13:26,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {3995#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); {3995#true} is VALID [2018-11-23 12:13:26,728 INFO L256 TraceCheckUtils]: 39: Hoare triple {3995#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3995#true} is VALID [2018-11-23 12:13:26,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {3995#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3995#true} is VALID [2018-11-23 12:13:26,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {3995#true} assume !(~i~1 > 5); {3995#true} is VALID [2018-11-23 12:13:26,729 INFO L273 TraceCheckUtils]: 43: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,729 INFO L273 TraceCheckUtils]: 44: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {3995#true} assume !(~i~1 > 5); {3995#true} is VALID [2018-11-23 12:13:26,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {3995#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3995#true} is VALID [2018-11-23 12:13:26,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {3995#true} assume !!(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {3995#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {3995#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {3995#true} assume !(~i~1 < 10); {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 54: Hoare triple {3995#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3995#true} is VALID [2018-11-23 12:13:26,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {3995#true} assume true; {3995#true} is VALID [2018-11-23 12:13:26,732 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {3995#true} {3995#true} #86#return; {3995#true} is VALID [2018-11-23 12:13:26,748 INFO L273 TraceCheckUtils]: 57: Hoare triple {3995#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; {4171#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:26,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {4171#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4171#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:26,760 INFO L273 TraceCheckUtils]: 59: Hoare triple {4171#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4178#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:26,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {4178#(<= main_~i~2 1)} assume !(~i~2 < 9); {3996#false} is VALID [2018-11-23 12:13:26,760 INFO L273 TraceCheckUtils]: 61: Hoare triple {3996#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3996#false} is VALID [2018-11-23 12:13:26,760 INFO L256 TraceCheckUtils]: 62: Hoare triple {3996#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 63: Hoare triple {3996#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 64: Hoare triple {3996#false} assume !!(~i~1 < 10); {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 65: Hoare triple {3996#false} assume !(~i~1 > 5); {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 66: Hoare triple {3996#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {3996#false} assume !!(~i~1 < 10); {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 68: Hoare triple {3996#false} assume !(~i~1 > 5); {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 69: Hoare triple {3996#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3996#false} is VALID [2018-11-23 12:13:26,761 INFO L273 TraceCheckUtils]: 70: Hoare triple {3996#false} assume !!(~i~1 < 10); {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {3996#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 72: Hoare triple {3996#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {3996#false} assume !!(~i~1 < 10); {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 74: Hoare triple {3996#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 75: Hoare triple {3996#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 76: Hoare triple {3996#false} assume !(~i~1 < 10); {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 77: Hoare triple {3996#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {3996#false} is VALID [2018-11-23 12:13:26,762 INFO L273 TraceCheckUtils]: 78: Hoare triple {3996#false} assume true; {3996#false} is VALID [2018-11-23 12:13:26,763 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {3996#false} {3996#false} #88#return; {3996#false} is VALID [2018-11-23 12:13:26,763 INFO L273 TraceCheckUtils]: 80: Hoare triple {3996#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3996#false} is VALID [2018-11-23 12:13:26,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {3996#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3996#false} is VALID [2018-11-23 12:13:26,763 INFO L273 TraceCheckUtils]: 82: Hoare triple {3996#false} assume !false; {3996#false} is VALID [2018-11-23 12:13:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-23 12:13:26,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:26,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:13:26,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-23 12:13:26,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:26,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:13:26,832 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:13:26,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:26,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:26,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,833 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-11-23 12:13:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:26,922 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 12:13:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:26,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-23 12:13:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:13:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-23 12:13:26,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-23 12:13:26,991 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:13:26,995 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:13:26,995 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:13:26,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:13:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:13:27,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:27,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:27,022 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:27,022 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:13:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:27,024 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:13:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:13:27,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:27,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:27,025 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:13:27,025 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:13:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:27,027 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:13:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:13:27,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:27,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:27,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:27,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:13:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 12:13:27,029 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 83 [2018-11-23 12:13:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:27,029 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 12:13:27,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:13:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:13:27,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:27,030 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 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, 1, 1, 1] [2018-11-23 12:13:27,030 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:27,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2064866548, now seen corresponding path program 7 times [2018-11-23 12:13:27,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:27,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:27,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:27,044 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:27,045 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:27,045 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:27,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:27,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {4534#true} call ULTIMATE.init(); {4534#true} is VALID [2018-11-23 12:13:27,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {4534#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4534#true} is VALID [2018-11-23 12:13:27,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {4534#true} assume true; {4534#true} is VALID [2018-11-23 12:13:27,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4534#true} {4534#true} #78#return; {4534#true} is VALID [2018-11-23 12:13:27,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {4534#true} call #t~ret12 := main(); {4534#true} is VALID [2018-11-23 12:13:27,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {4534#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {4534#true} is VALID [2018-11-23 12:13:27,429 INFO L256 TraceCheckUtils]: 6: Hoare triple {4534#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4534#true} is VALID [2018-11-23 12:13:27,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {4534#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {4560#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:27,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {4560#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4560#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:27,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {4560#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4567#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:27,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {4567#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4567#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:27,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {4567#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4574#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:27,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {4574#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4574#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:27,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {4574#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4581#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:27,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {4581#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {4581#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:27,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {4581#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4588#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:27,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {4588#(<= init_nondet_~i~0 4)} assume !(~i~0 < 10); {4535#false} is VALID [2018-11-23 12:13:27,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {4535#false} assume true; {4535#false} is VALID [2018-11-23 12:13:27,435 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {4535#false} {4534#true} #82#return; {4535#false} is VALID [2018-11-23 12:13:27,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {4535#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4535#false} is VALID [2018-11-23 12:13:27,435 INFO L256 TraceCheckUtils]: 20: Hoare triple {4535#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4535#false} is VALID [2018-11-23 12:13:27,435 INFO L273 TraceCheckUtils]: 21: Hoare triple {4535#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4535#false} is VALID [2018-11-23 12:13:27,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,436 INFO L273 TraceCheckUtils]: 26: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,437 INFO L273 TraceCheckUtils]: 28: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,438 INFO L273 TraceCheckUtils]: 31: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {4535#false} assume !(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {4535#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4535#false} is VALID [2018-11-23 12:13:27,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {4535#false} assume true; {4535#false} is VALID [2018-11-23 12:13:27,439 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4535#false} {4535#false} #84#return; {4535#false} is VALID [2018-11-23 12:13:27,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {4535#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4535#false} is VALID [2018-11-23 12:13:27,439 INFO L256 TraceCheckUtils]: 39: Hoare triple {4535#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4535#false} is VALID [2018-11-23 12:13:27,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {4535#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4535#false} is VALID [2018-11-23 12:13:27,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,440 INFO L273 TraceCheckUtils]: 43: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,440 INFO L273 TraceCheckUtils]: 44: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 46: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 47: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 48: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 53: Hoare triple {4535#false} assume !(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {4535#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {4535#false} assume true; {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {4535#false} {4535#false} #86#return; {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 57: Hoare triple {4535#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4535#false} is VALID [2018-11-23 12:13:27,442 INFO L273 TraceCheckUtils]: 58: Hoare triple {4535#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {4535#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {4535#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {4535#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {4535#false} assume !(~i~2 < 9); {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {4535#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L256 TraceCheckUtils]: 64: Hoare triple {4535#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 65: Hoare triple {4535#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {4535#false} is VALID [2018-11-23 12:13:27,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {4535#false} assume !(~i~1 > 5); {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 73: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {4535#false} assume !!(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {4535#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {4535#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 78: Hoare triple {4535#false} assume !(~i~1 < 10); {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 79: Hoare triple {4535#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {4535#false} is VALID [2018-11-23 12:13:27,445 INFO L273 TraceCheckUtils]: 80: Hoare triple {4535#false} assume true; {4535#false} is VALID [2018-11-23 12:13:27,446 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4535#false} {4535#false} #88#return; {4535#false} is VALID [2018-11-23 12:13:27,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {4535#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4535#false} is VALID [2018-11-23 12:13:27,446 INFO L273 TraceCheckUtils]: 83: Hoare triple {4535#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4535#false} is VALID [2018-11-23 12:13:27,446 INFO L273 TraceCheckUtils]: 84: Hoare triple {4535#false} assume !false; {4535#false} is VALID [2018-11-23 12:13:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:13:27,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:27,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:27,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 12:13:27,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:27,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:27,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:27,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:27,595 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-23 12:13:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,456 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 12:13:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:28,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 12:13:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 12:13:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 12:13:28,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2018-11-23 12:13:28,556 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:13:28,558 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:13:28,558 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:13:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:13:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 12:13:28,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:28,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 12:13:28,629 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 12:13:28,629 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 12:13:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,631 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:13:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:13:28,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:28,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:28,631 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 12:13:28,631 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 12:13:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:28,633 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:13:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:13:28,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:28,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:28,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:28,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:13:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-23 12:13:28,635 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 85 [2018-11-23 12:13:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-23 12:13:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:13:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:13:28,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:28,636 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 5, 5, 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, 1, 1, 1] [2018-11-23 12:13:28,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash -998650230, now seen corresponding path program 8 times [2018-11-23 12:13:28,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:28,650 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:28,650 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:28,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:28,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:28,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:28,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:28,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2018-11-23 12:13:28,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {5109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5109#true} is VALID [2018-11-23 12:13:28,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2018-11-23 12:13:28,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #78#return; {5109#true} is VALID [2018-11-23 12:13:28,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret12 := main(); {5109#true} is VALID [2018-11-23 12:13:28,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {5109#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {5109#true} is VALID [2018-11-23 12:13:28,865 INFO L256 TraceCheckUtils]: 6: Hoare triple {5109#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5109#true} is VALID [2018-11-23 12:13:28,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {5109#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5135#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:28,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5135#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:28,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {5135#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5142#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:28,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {5142#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5142#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:28,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {5142#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5149#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:28,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {5149#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5149#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:28,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {5149#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5156#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:28,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {5156#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5156#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:28,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {5156#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5163#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:28,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {5163#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5163#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:28,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {5163#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5170#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:28,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {5170#(<= init_nondet_~i~0 5)} assume !(~i~0 < 10); {5110#false} is VALID [2018-11-23 12:13:28,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {5110#false} assume true; {5110#false} is VALID [2018-11-23 12:13:28,873 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5110#false} {5109#true} #82#return; {5110#false} is VALID [2018-11-23 12:13:28,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {5110#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5110#false} is VALID [2018-11-23 12:13:28,873 INFO L256 TraceCheckUtils]: 22: Hoare triple {5110#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5110#false} is VALID [2018-11-23 12:13:28,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {5110#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5110#false} is VALID [2018-11-23 12:13:28,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {5110#false} assume !(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {5110#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {5110#false} assume true; {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5110#false} {5110#false} #84#return; {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {5110#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L256 TraceCheckUtils]: 41: Hoare triple {5110#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {5110#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 49: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 53: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {5110#false} assume !(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {5110#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {5110#false} assume true; {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {5110#false} {5110#false} #86#return; {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {5110#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5110#false} is VALID [2018-11-23 12:13:28,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {5110#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 61: Hoare triple {5110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 62: Hoare triple {5110#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 63: Hoare triple {5110#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 64: Hoare triple {5110#false} assume !(~i~2 < 9); {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 65: Hoare triple {5110#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L256 TraceCheckUtils]: 66: Hoare triple {5110#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {5110#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 71: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {5110#false} assume !(~i~1 > 5); {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {5110#false} assume !!(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 78: Hoare triple {5110#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 79: Hoare triple {5110#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 80: Hoare triple {5110#false} assume !(~i~1 < 10); {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {5110#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {5110#false} assume true; {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {5110#false} {5110#false} #88#return; {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {5110#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5110#false} is VALID [2018-11-23 12:13:28,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {5110#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5110#false} is VALID [2018-11-23 12:13:28,883 INFO L273 TraceCheckUtils]: 86: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2018-11-23 12:13:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:13:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:28,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:13:28,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-23 12:13:28,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:28,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:13:28,959 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:13:28,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:13:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:13:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:28,961 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 8 states. [2018-11-23 12:13:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:29,545 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2018-11-23 12:13:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:13:29,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-23 12:13:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2018-11-23 12:13:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2018-11-23 12:13:29,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2018-11-23 12:13:29,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:29,624 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:13:29,625 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:13:29,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:13:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 12:13:29,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:29,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:29,766 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:29,767 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 12:13:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:29,772 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:13:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:13:29,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:29,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:29,773 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 12:13:29,773 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 12:13:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:29,774 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:13:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:13:29,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:29,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:29,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:29,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:13:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-23 12:13:29,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 87 [2018-11-23 12:13:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:29,777 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-23 12:13:29,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:13:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-23 12:13:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:13:29,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:29,779 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 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, 1, 1, 1] [2018-11-23 12:13:29,779 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:29,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1433014920, now seen corresponding path program 9 times [2018-11-23 12:13:29,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:29,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:29,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:29,805 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:29,809 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:29,809 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:29,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:13:29,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:29,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:30,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {5701#true} call ULTIMATE.init(); {5701#true} is VALID [2018-11-23 12:13:30,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {5701#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5701#true} is VALID [2018-11-23 12:13:30,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {5701#true} assume true; {5701#true} is VALID [2018-11-23 12:13:30,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5701#true} {5701#true} #78#return; {5701#true} is VALID [2018-11-23 12:13:30,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {5701#true} call #t~ret12 := main(); {5701#true} is VALID [2018-11-23 12:13:30,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {5701#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {5701#true} is VALID [2018-11-23 12:13:30,094 INFO L256 TraceCheckUtils]: 6: Hoare triple {5701#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5701#true} is VALID [2018-11-23 12:13:30,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {5701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {5701#true} is VALID [2018-11-23 12:13:30,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {5701#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {5701#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5701#true} is VALID [2018-11-23 12:13:30,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {5701#true} assume !(~i~0 < 10); {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {5701#true} assume true; {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {5701#true} {5701#true} #82#return; {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {5701#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L256 TraceCheckUtils]: 24: Hoare triple {5701#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {5701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5701#true} is VALID [2018-11-23 12:13:30,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {5701#true} assume !(~i~1 > 5); {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {5701#true} assume !(~i~1 > 5); {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {5701#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {5701#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {5701#true} assume !(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {5701#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {5701#true} assume true; {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5701#true} {5701#true} #84#return; {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {5701#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); {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L256 TraceCheckUtils]: 43: Hoare triple {5701#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L273 TraceCheckUtils]: 44: Hoare triple {5701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {5701#true} assume !(~i~1 > 5); {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 48: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {5701#true} assume !(~i~1 > 5); {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {5701#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 54: Hoare triple {5701#true} assume !!(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 55: Hoare triple {5701#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 56: Hoare triple {5701#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 57: Hoare triple {5701#true} assume !(~i~1 < 10); {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {5701#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5701#true} is VALID [2018-11-23 12:13:30,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {5701#true} assume true; {5701#true} is VALID [2018-11-23 12:13:30,103 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {5701#true} {5701#true} #86#return; {5701#true} is VALID [2018-11-23 12:13:30,103 INFO L273 TraceCheckUtils]: 61: Hoare triple {5701#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; {5889#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:30,104 INFO L273 TraceCheckUtils]: 62: Hoare triple {5889#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.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#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:30,104 INFO L273 TraceCheckUtils]: 63: Hoare triple {5889#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5896#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:30,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {5896#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5896#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:30,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {5896#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5903#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:30,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {5903#(<= main_~i~2 2)} assume !(~i~2 < 9); {5702#false} is VALID [2018-11-23 12:13:30,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {5702#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5702#false} is VALID [2018-11-23 12:13:30,106 INFO L256 TraceCheckUtils]: 68: Hoare triple {5702#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5702#false} is VALID [2018-11-23 12:13:30,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {5702#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {5702#false} is VALID [2018-11-23 12:13:30,106 INFO L273 TraceCheckUtils]: 70: Hoare triple {5702#false} assume !!(~i~1 < 10); {5702#false} is VALID [2018-11-23 12:13:30,107 INFO L273 TraceCheckUtils]: 71: Hoare triple {5702#false} assume !(~i~1 > 5); {5702#false} is VALID [2018-11-23 12:13:30,107 INFO L273 TraceCheckUtils]: 72: Hoare triple {5702#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5702#false} is VALID [2018-11-23 12:13:30,107 INFO L273 TraceCheckUtils]: 73: Hoare triple {5702#false} assume !!(~i~1 < 10); {5702#false} is VALID [2018-11-23 12:13:30,107 INFO L273 TraceCheckUtils]: 74: Hoare triple {5702#false} assume !(~i~1 > 5); {5702#false} is VALID [2018-11-23 12:13:30,107 INFO L273 TraceCheckUtils]: 75: Hoare triple {5702#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5702#false} is VALID [2018-11-23 12:13:30,108 INFO L273 TraceCheckUtils]: 76: Hoare triple {5702#false} assume !!(~i~1 < 10); {5702#false} is VALID [2018-11-23 12:13:30,108 INFO L273 TraceCheckUtils]: 77: Hoare triple {5702#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 78: Hoare triple {5702#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 79: Hoare triple {5702#false} assume !!(~i~1 < 10); {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 80: Hoare triple {5702#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 81: Hoare triple {5702#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 82: Hoare triple {5702#false} assume !(~i~1 < 10); {5702#false} is VALID [2018-11-23 12:13:30,109 INFO L273 TraceCheckUtils]: 83: Hoare triple {5702#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {5702#false} is VALID [2018-11-23 12:13:30,110 INFO L273 TraceCheckUtils]: 84: Hoare triple {5702#false} assume true; {5702#false} is VALID [2018-11-23 12:13:30,110 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {5702#false} {5702#false} #88#return; {5702#false} is VALID [2018-11-23 12:13:30,110 INFO L273 TraceCheckUtils]: 86: Hoare triple {5702#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5702#false} is VALID [2018-11-23 12:13:30,110 INFO L273 TraceCheckUtils]: 87: Hoare triple {5702#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5702#false} is VALID [2018-11-23 12:13:30,110 INFO L273 TraceCheckUtils]: 88: Hoare triple {5702#false} assume !false; {5702#false} is VALID [2018-11-23 12:13:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-23 12:13:30,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:30,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:13:30,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-23 12:13:30,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:30,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:13:30,202 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:13:30,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:13:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:13:30,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:13:30,204 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2018-11-23 12:13:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:30,391 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-11-23 12:13:30,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:13:30,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-23 12:13:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:13:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:13:30,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-23 12:13:30,969 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:13:30,971 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:13:30,971 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:13:30,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:13:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:13:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 12:13:30,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:30,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:30,996 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:30,996 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 12:13:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:30,998 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:13:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:13:30,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:30,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:31,000 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 12:13:31,000 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 12:13:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:31,002 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 12:13:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 12:13:31,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:31,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:31,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:31,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:13:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-11-23 12:13:31,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 89 [2018-11-23 12:13:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:31,006 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-11-23 12:13:31,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:13:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-11-23 12:13:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:13:31,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:31,007 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 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, 1] [2018-11-23 12:13:31,007 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:31,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash -820958554, now seen corresponding path program 10 times [2018-11-23 12:13:31,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:31,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:31,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:31,022 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:31,022 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:31,022 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:31,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:31,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:31,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:31,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {6289#true} call ULTIMATE.init(); {6289#true} is VALID [2018-11-23 12:13:31,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {6289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6289#true} is VALID [2018-11-23 12:13:31,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {6289#true} assume true; {6289#true} is VALID [2018-11-23 12:13:31,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6289#true} {6289#true} #78#return; {6289#true} is VALID [2018-11-23 12:13:31,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {6289#true} call #t~ret12 := main(); {6289#true} is VALID [2018-11-23 12:13:31,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {6289#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {6289#true} is VALID [2018-11-23 12:13:31,981 INFO L256 TraceCheckUtils]: 6: Hoare triple {6289#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6289#true} is VALID [2018-11-23 12:13:31,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {6289#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6315#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:31,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {6315#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6315#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:31,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:31,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {6322#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6322#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:31,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {6322#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6329#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:31,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {6329#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6329#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:31,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {6329#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6336#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:31,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {6336#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6336#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:31,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {6336#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6343#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:31,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {6343#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6343#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:31,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {6343#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6350#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:31,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {6350#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6350#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:31,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {6350#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6357#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:31,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {6357#(<= init_nondet_~i~0 6)} assume !(~i~0 < 10); {6290#false} is VALID [2018-11-23 12:13:31,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {6290#false} assume true; {6290#false} is VALID [2018-11-23 12:13:31,989 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {6290#false} {6289#true} #82#return; {6290#false} is VALID [2018-11-23 12:13:31,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {6290#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6290#false} is VALID [2018-11-23 12:13:31,990 INFO L256 TraceCheckUtils]: 24: Hoare triple {6290#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6290#false} is VALID [2018-11-23 12:13:31,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {6290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6290#false} is VALID [2018-11-23 12:13:31,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,991 INFO L273 TraceCheckUtils]: 32: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,992 INFO L273 TraceCheckUtils]: 36: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {6290#false} assume !(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {6290#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6290#false} is VALID [2018-11-23 12:13:31,993 INFO L273 TraceCheckUtils]: 40: Hoare triple {6290#false} assume true; {6290#false} is VALID [2018-11-23 12:13:31,993 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6290#false} {6290#false} #84#return; {6290#false} is VALID [2018-11-23 12:13:31,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {6290#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L256 TraceCheckUtils]: 43: Hoare triple {6290#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {6290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,994 INFO L273 TraceCheckUtils]: 50: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 51: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 52: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 53: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 54: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 56: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {6290#false} assume !(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,995 INFO L273 TraceCheckUtils]: 58: Hoare triple {6290#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 59: Hoare triple {6290#false} assume true; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {6290#false} {6290#false} #86#return; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {6290#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {6290#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {6290#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 64: Hoare triple {6290#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {6290#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {6290#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6290#false} is VALID [2018-11-23 12:13:31,996 INFO L273 TraceCheckUtils]: 67: Hoare triple {6290#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 68: Hoare triple {6290#false} assume !(~i~2 < 9); {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 69: Hoare triple {6290#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L256 TraceCheckUtils]: 70: Hoare triple {6290#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 71: Hoare triple {6290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 72: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {6290#false} assume !(~i~1 > 5); {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 77: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 78: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 79: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 81: Hoare triple {6290#false} assume !!(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 82: Hoare triple {6290#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6290#false} is VALID [2018-11-23 12:13:31,998 INFO L273 TraceCheckUtils]: 83: Hoare triple {6290#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 84: Hoare triple {6290#false} assume !(~i~1 < 10); {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {6290#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {6290#false} assume true; {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6290#false} {6290#false} #88#return; {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 88: Hoare triple {6290#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 89: Hoare triple {6290#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6290#false} is VALID [2018-11-23 12:13:31,999 INFO L273 TraceCheckUtils]: 90: Hoare triple {6290#false} assume !false; {6290#false} is VALID [2018-11-23 12:13:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-11-23 12:13:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:32,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:13:32,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-23 12:13:32,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:32,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:13:32,069 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:13:32,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:13:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:13:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:32,070 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 9 states. [2018-11-23 12:13:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:32,345 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 12:13:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:13:32,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-23 12:13:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:13:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:13:32,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2018-11-23 12:13:32,424 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:13:32,426 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:13:32,426 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:13:32,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:13:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 12:13:32,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:32,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:32,452 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:32,452 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 12:13:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:32,454 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-23 12:13:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 12:13:32,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:32,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:32,455 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 12:13:32,455 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 12:13:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:32,457 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-23 12:13:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 12:13:32,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:32,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:32,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:32,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:13:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-23 12:13:32,460 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 91 [2018-11-23 12:13:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:32,460 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-23 12:13:32,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:13:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 12:13:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:13:32,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:32,461 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 6, 6, 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, 1] [2018-11-23 12:13:32,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:32,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash 639844260, now seen corresponding path program 11 times [2018-11-23 12:13:32,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:32,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:32,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:32,476 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:32,476 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:32,476 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:32,494 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:32,521 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:13:32,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:32,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:33,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {6917#true} call ULTIMATE.init(); {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {6917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {6917#true} assume true; {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6917#true} {6917#true} #78#return; {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {6917#true} call #t~ret12 := main(); {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {6917#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {6917#true} is VALID [2018-11-23 12:13:33,090 INFO L256 TraceCheckUtils]: 6: Hoare triple {6917#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {6917#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {6917#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {6917#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {6917#true} assume !(~i~0 < 10); {6917#true} is VALID [2018-11-23 12:13:33,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {6917#true} assume true; {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {6917#true} {6917#true} #82#return; {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {6917#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L256 TraceCheckUtils]: 26: Hoare triple {6917#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {6917#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {6917#true} assume !!(~i~1 < 10); {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {6917#true} assume !(~i~1 > 5); {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {6917#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6917#true} is VALID [2018-11-23 12:13:33,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {6917#true} assume !!(~i~1 < 10); {6917#true} is VALID [2018-11-23 12:13:33,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {6917#true} assume !(~i~1 > 5); {7018#(<= rangesum_~i~1 5)} is VALID [2018-11-23 12:13:33,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {7018#(<= rangesum_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7022#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:33,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {7022#(<= rangesum_~i~1 6)} assume !!(~i~1 < 10); {7022#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:33,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {7022#(<= rangesum_~i~1 6)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7022#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:33,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {7022#(<= rangesum_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7032#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:33,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {7032#(<= rangesum_~i~1 7)} assume !!(~i~1 < 10); {7032#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:33,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {7032#(<= rangesum_~i~1 7)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7032#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:33,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {7032#(<= rangesum_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7042#(<= rangesum_~i~1 8)} is VALID [2018-11-23 12:13:33,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {7042#(<= rangesum_~i~1 8)} assume !(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {6918#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6918#false} is VALID [2018-11-23 12:13:33,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {6918#false} assume true; {6918#false} is VALID [2018-11-23 12:13:33,098 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {6918#false} {6917#true} #84#return; {6918#false} is VALID [2018-11-23 12:13:33,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {6918#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6918#false} is VALID [2018-11-23 12:13:33,099 INFO L256 TraceCheckUtils]: 45: Hoare triple {6918#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6918#false} is VALID [2018-11-23 12:13:33,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {6918#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6918#false} is VALID [2018-11-23 12:13:33,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {6918#false} assume !(~i~1 > 5); {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 50: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 51: Hoare triple {6918#false} assume !(~i~1 > 5); {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 52: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 53: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {6918#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 55: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,100 INFO L273 TraceCheckUtils]: 56: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 57: Hoare triple {6918#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 58: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 59: Hoare triple {6918#false} assume !(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 60: Hoare triple {6918#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 61: Hoare triple {6918#false} assume true; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {6918#false} {6918#false} #86#return; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 63: Hoare triple {6918#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 64: Hoare triple {6918#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6918#false} is VALID [2018-11-23 12:13:33,101 INFO L273 TraceCheckUtils]: 65: Hoare triple {6918#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 66: Hoare triple {6918#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 67: Hoare triple {6918#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 68: Hoare triple {6918#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 69: Hoare triple {6918#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 70: Hoare triple {6918#false} assume !(~i~2 < 9); {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 71: Hoare triple {6918#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L256 TraceCheckUtils]: 72: Hoare triple {6918#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6918#false} is VALID [2018-11-23 12:13:33,102 INFO L273 TraceCheckUtils]: 73: Hoare triple {6918#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 74: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 75: Hoare triple {6918#false} assume !(~i~1 > 5); {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 76: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 77: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 78: Hoare triple {6918#false} assume !(~i~1 > 5); {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 79: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,103 INFO L273 TraceCheckUtils]: 81: Hoare triple {6918#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 82: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 83: Hoare triple {6918#false} assume !!(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 84: Hoare triple {6918#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 85: Hoare triple {6918#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 86: Hoare triple {6918#false} assume !(~i~1 < 10); {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 87: Hoare triple {6918#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 88: Hoare triple {6918#false} assume true; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {6918#false} {6918#false} #88#return; {6918#false} is VALID [2018-11-23 12:13:33,104 INFO L273 TraceCheckUtils]: 90: Hoare triple {6918#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6918#false} is VALID [2018-11-23 12:13:33,105 INFO L273 TraceCheckUtils]: 91: Hoare triple {6918#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6918#false} is VALID [2018-11-23 12:13:33,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {6918#false} assume !false; {6918#false} is VALID [2018-11-23 12:13:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 129 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-23 12:13:33,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:33,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:33,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-23 12:13:33,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:33,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:33,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:33,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:33,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:33,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:33,189 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2018-11-23 12:13:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:33,646 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-11-23 12:13:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:33,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-23 12:13:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:13:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2018-11-23 12:13:33,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2018-11-23 12:13:33,805 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:13:33,807 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:13:33,807 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:13:33,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:13:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:13:33,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:33,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:13:33,830 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:13:33,830 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:13:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:33,832 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-23 12:13:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-23 12:13:33,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:33,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:33,833 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:13:33,834 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:13:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:33,835 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-23 12:13:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-23 12:13:33,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:33,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:33,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:33,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:13:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-23 12:13:33,838 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 93 [2018-11-23 12:13:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:33,838 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-23 12:13:33,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-23 12:13:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:13:33,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:33,840 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 7, 7, 6, 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, 1] [2018-11-23 12:13:33,840 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:33,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:33,840 INFO L82 PathProgramCache]: Analyzing trace with hash 266389106, now seen corresponding path program 12 times [2018-11-23 12:13:33,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:33,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:33,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:33,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:33,853 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:33,853 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:34,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:13:34,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:34,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:35,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {7560#true} call ULTIMATE.init(); {7560#true} is VALID [2018-11-23 12:13:35,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {7560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7560#true} is VALID [2018-11-23 12:13:35,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {7560#true} assume true; {7560#true} is VALID [2018-11-23 12:13:35,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7560#true} {7560#true} #78#return; {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {7560#true} call #t~ret12 := main(); {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {7560#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L256 TraceCheckUtils]: 6: Hoare triple {7560#true} call init_nondet(~#x~0.base, ~#x~0.offset); {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {7560#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {7560#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {7560#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {7560#true} assume !(~i~0 < 10); {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {7560#true} assume true; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {7560#true} {7560#true} #82#return; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {7560#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {7560#true} is VALID [2018-11-23 12:13:35,090 INFO L256 TraceCheckUtils]: 26: Hoare triple {7560#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {7560#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {7560#true} assume !(~i~1 > 5); {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {7560#true} assume !(~i~1 > 5); {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {7560#true} assume !(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {7560#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {7560#true} assume true; {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {7560#true} {7560#true} #84#return; {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 47: Hoare triple {7560#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); {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L256 TraceCheckUtils]: 48: Hoare triple {7560#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 49: Hoare triple {7560#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {7560#true} is VALID [2018-11-23 12:13:35,093 INFO L273 TraceCheckUtils]: 50: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {7560#true} assume !(~i~1 > 5); {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 54: Hoare triple {7560#true} assume !(~i~1 > 5); {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 55: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 56: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 57: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 58: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,094 INFO L273 TraceCheckUtils]: 59: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 60: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 61: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 62: Hoare triple {7560#true} assume !!(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {7560#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {7560#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {7560#true} assume !(~i~1 < 10); {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {7560#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {7560#true} is VALID [2018-11-23 12:13:35,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {7560#true} assume true; {7560#true} is VALID [2018-11-23 12:13:35,096 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {7560#true} {7560#true} #86#return; {7560#true} is VALID [2018-11-23 12:13:35,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {7560#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; {7772#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:35,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {7772#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7772#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:35,097 INFO L273 TraceCheckUtils]: 71: Hoare triple {7772#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7779#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:35,098 INFO L273 TraceCheckUtils]: 72: Hoare triple {7779#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7779#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:35,098 INFO L273 TraceCheckUtils]: 73: Hoare triple {7779#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7786#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:35,098 INFO L273 TraceCheckUtils]: 74: Hoare triple {7786#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7786#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:35,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {7786#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7793#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:35,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {7793#(<= main_~i~2 3)} assume !(~i~2 < 9); {7561#false} is VALID [2018-11-23 12:13:35,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {7561#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7561#false} is VALID [2018-11-23 12:13:35,099 INFO L256 TraceCheckUtils]: 78: Hoare triple {7561#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 79: Hoare triple {7561#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 80: Hoare triple {7561#false} assume !!(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 81: Hoare triple {7561#false} assume !(~i~1 > 5); {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {7561#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {7561#false} assume !!(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {7561#false} assume !(~i~1 > 5); {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {7561#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7561#false} is VALID [2018-11-23 12:13:35,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {7561#false} assume !!(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,101 INFO L273 TraceCheckUtils]: 87: Hoare triple {7561#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7561#false} is VALID [2018-11-23 12:13:35,101 INFO L273 TraceCheckUtils]: 88: Hoare triple {7561#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7561#false} is VALID [2018-11-23 12:13:35,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {7561#false} assume !!(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {7561#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7561#false} is VALID [2018-11-23 12:13:35,101 INFO L273 TraceCheckUtils]: 91: Hoare triple {7561#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7561#false} is VALID [2018-11-23 12:13:35,102 INFO L273 TraceCheckUtils]: 92: Hoare triple {7561#false} assume !!(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,102 INFO L273 TraceCheckUtils]: 93: Hoare triple {7561#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {7561#false} is VALID [2018-11-23 12:13:35,102 INFO L273 TraceCheckUtils]: 94: Hoare triple {7561#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7561#false} is VALID [2018-11-23 12:13:35,102 INFO L273 TraceCheckUtils]: 95: Hoare triple {7561#false} assume !(~i~1 < 10); {7561#false} is VALID [2018-11-23 12:13:35,102 INFO L273 TraceCheckUtils]: 96: Hoare triple {7561#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {7561#false} is VALID [2018-11-23 12:13:35,103 INFO L273 TraceCheckUtils]: 97: Hoare triple {7561#false} assume true; {7561#false} is VALID [2018-11-23 12:13:35,103 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {7561#false} {7561#false} #88#return; {7561#false} is VALID [2018-11-23 12:13:35,103 INFO L273 TraceCheckUtils]: 99: Hoare triple {7561#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7561#false} is VALID [2018-11-23 12:13:35,103 INFO L273 TraceCheckUtils]: 100: Hoare triple {7561#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7561#false} is VALID [2018-11-23 12:13:35,103 INFO L273 TraceCheckUtils]: 101: Hoare triple {7561#false} assume !false; {7561#false} is VALID [2018-11-23 12:13:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-23 12:13:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:35,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:13:35,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-23 12:13:35,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:35,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:13:35,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:35,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:13:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:13:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:35,175 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2018-11-23 12:13:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:35,288 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-11-23 12:13:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:13:35,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-23 12:13:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:13:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:13:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:13:35,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:13:35,347 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:13:35,349 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:13:35,349 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:13:35,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:13:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:13:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 12:13:35,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:35,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 12:13:35,448 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 12:13:35,448 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 12:13:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:35,449 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:13:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:13:35,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:35,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:35,450 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 12:13:35,450 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 12:13:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:35,451 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:13:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:13:35,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:35,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:35,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:35,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:13:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-23 12:13:35,453 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 102 [2018-11-23 12:13:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-23 12:13:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:13:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:13:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 12:13:35,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:35,455 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 7, 7, 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, 1, 1, 1] [2018-11-23 12:13:35,455 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:35,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 902866836, now seen corresponding path program 13 times [2018-11-23 12:13:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:35,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:35,469 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:35,469 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:35,469 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:35,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:35,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {8226#true} call ULTIMATE.init(); {8226#true} is VALID [2018-11-23 12:13:35,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {8226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8226#true} is VALID [2018-11-23 12:13:35,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {8226#true} assume true; {8226#true} is VALID [2018-11-23 12:13:35,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8226#true} {8226#true} #78#return; {8226#true} is VALID [2018-11-23 12:13:35,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {8226#true} call #t~ret12 := main(); {8226#true} is VALID [2018-11-23 12:13:35,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {8226#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {8226#true} is VALID [2018-11-23 12:13:35,767 INFO L256 TraceCheckUtils]: 6: Hoare triple {8226#true} call init_nondet(~#x~0.base, ~#x~0.offset); {8226#true} is VALID [2018-11-23 12:13:35,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {8226#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {8252#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:35,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {8252#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8252#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:35,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {8252#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8259#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:35,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {8259#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8259#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:35,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {8259#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8266#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:35,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {8266#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8266#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:35,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {8266#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8273#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:35,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {8273#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8273#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:35,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {8273#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8280#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:35,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {8280#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8280#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:35,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {8280#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8287#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:35,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {8287#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8287#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:35,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {8287#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8294#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:35,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {8294#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8294#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:35,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {8294#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8301#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:35,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {8301#(<= init_nondet_~i~0 7)} assume !(~i~0 < 10); {8227#false} is VALID [2018-11-23 12:13:35,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {8227#false} assume true; {8227#false} is VALID [2018-11-23 12:13:35,776 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {8227#false} {8226#true} #82#return; {8227#false} is VALID [2018-11-23 12:13:35,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {8227#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {8227#false} is VALID [2018-11-23 12:13:35,776 INFO L256 TraceCheckUtils]: 26: Hoare triple {8227#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {8227#false} is VALID [2018-11-23 12:13:35,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {8227#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8227#false} is VALID [2018-11-23 12:13:35,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {8227#false} assume !(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {8227#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8227#false} is VALID [2018-11-23 12:13:35,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {8227#false} assume true; {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {8227#false} {8227#false} #84#return; {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {8227#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L256 TraceCheckUtils]: 48: Hoare triple {8227#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {8227#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,781 INFO L273 TraceCheckUtils]: 53: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,782 INFO L273 TraceCheckUtils]: 62: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {8227#false} assume !(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {8227#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {8227#false} assume true; {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8227#false} {8227#false} #86#return; {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 69: Hoare triple {8227#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8227#false} is VALID [2018-11-23 12:13:35,783 INFO L273 TraceCheckUtils]: 70: Hoare triple {8227#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {8227#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {8227#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 73: Hoare triple {8227#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 74: Hoare triple {8227#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 75: Hoare triple {8227#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 76: Hoare triple {8227#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 77: Hoare triple {8227#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 78: Hoare triple {8227#false} assume !(~i~2 < 9); {8227#false} is VALID [2018-11-23 12:13:35,784 INFO L273 TraceCheckUtils]: 79: Hoare triple {8227#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8227#false} is VALID [2018-11-23 12:13:35,785 INFO L256 TraceCheckUtils]: 80: Hoare triple {8227#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {8227#false} is VALID [2018-11-23 12:13:35,785 INFO L273 TraceCheckUtils]: 81: Hoare triple {8227#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8227#false} is VALID [2018-11-23 12:13:35,785 INFO L273 TraceCheckUtils]: 82: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,785 INFO L273 TraceCheckUtils]: 83: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,785 INFO L273 TraceCheckUtils]: 84: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 85: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 86: Hoare triple {8227#false} assume !(~i~1 > 5); {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 87: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 88: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 89: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,786 INFO L273 TraceCheckUtils]: 90: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 91: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 94: Hoare triple {8227#false} assume !!(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 95: Hoare triple {8227#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8227#false} is VALID [2018-11-23 12:13:35,787 INFO L273 TraceCheckUtils]: 96: Hoare triple {8227#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L273 TraceCheckUtils]: 97: Hoare triple {8227#false} assume !(~i~1 < 10); {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L273 TraceCheckUtils]: 98: Hoare triple {8227#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L273 TraceCheckUtils]: 99: Hoare triple {8227#false} assume true; {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {8227#false} {8227#false} #88#return; {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L273 TraceCheckUtils]: 101: Hoare triple {8227#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8227#false} is VALID [2018-11-23 12:13:35,788 INFO L273 TraceCheckUtils]: 102: Hoare triple {8227#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8227#false} is VALID [2018-11-23 12:13:35,789 INFO L273 TraceCheckUtils]: 103: Hoare triple {8227#false} assume !false; {8227#false} is VALID [2018-11-23 12:13:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:13:35,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:13:35,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-11-23 12:13:35,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:35,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:13:35,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:35,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:13:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:13:35,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:13:35,873 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 10 states. [2018-11-23 12:13:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,056 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-11-23 12:13:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:13:36,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-11-23 12:13:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:13:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:13:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:13:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:13:36,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2018-11-23 12:13:36,139 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:13:36,141 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:13:36,141 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:13:36,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:13:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:13:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 12:13:36,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:36,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 12:13:36,243 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 12:13:36,243 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 12:13:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,246 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-23 12:13:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-11-23 12:13:36,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:36,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:36,247 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 12:13:36,247 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 12:13:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,253 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-23 12:13:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-11-23 12:13:36,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:36,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:36,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:36,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:13:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-23 12:13:36,256 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 104 [2018-11-23 12:13:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:36,256 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-23 12:13:36,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:13:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-23 12:13:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:13:36,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:36,257 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 8, 8, 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, 1, 1, 1] [2018-11-23 12:13:36,257 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:36,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:36,258 INFO L82 PathProgramCache]: Analyzing trace with hash -640868522, now seen corresponding path program 14 times [2018-11-23 12:13:36,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:36,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:36,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:36,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:36,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:36,276 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:36,276 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:36,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:36,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:36,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:36,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:36,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:36,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {8935#true} call ULTIMATE.init(); {8935#true} is VALID [2018-11-23 12:13:36,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {8935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8935#true} is VALID [2018-11-23 12:13:36,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {8935#true} assume true; {8935#true} is VALID [2018-11-23 12:13:36,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8935#true} {8935#true} #78#return; {8935#true} is VALID [2018-11-23 12:13:36,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {8935#true} call #t~ret12 := main(); {8935#true} is VALID [2018-11-23 12:13:36,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {8935#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {8935#true} is VALID [2018-11-23 12:13:36,561 INFO L256 TraceCheckUtils]: 6: Hoare triple {8935#true} call init_nondet(~#x~0.base, ~#x~0.offset); {8935#true} is VALID [2018-11-23 12:13:36,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {8935#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {8961#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:36,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {8961#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8961#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:36,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {8961#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8968#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:36,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {8968#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8968#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:36,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {8968#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8975#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:36,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {8975#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8975#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:36,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {8975#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8982#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:36,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {8982#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8982#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:36,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {8982#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8989#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:36,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {8989#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8989#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:36,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {8989#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8996#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:36,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {8996#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {8996#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:36,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {8996#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9003#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:36,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {9003#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9003#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:36,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {9003#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9010#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:36,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {9010#(<= init_nondet_~i~0 7)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9010#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:36,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {9010#(<= init_nondet_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9017#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:13:36,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {9017#(<= init_nondet_~i~0 8)} assume !(~i~0 < 10); {8936#false} is VALID [2018-11-23 12:13:36,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {8936#false} assume true; {8936#false} is VALID [2018-11-23 12:13:36,572 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {8936#false} {8935#true} #82#return; {8936#false} is VALID [2018-11-23 12:13:36,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {8936#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {8936#false} is VALID [2018-11-23 12:13:36,573 INFO L256 TraceCheckUtils]: 28: Hoare triple {8936#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {8936#false} is VALID [2018-11-23 12:13:36,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {8936#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8936#false} is VALID [2018-11-23 12:13:36,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {8936#false} assume !(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {8936#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8936#false} is VALID [2018-11-23 12:13:36,575 INFO L273 TraceCheckUtils]: 47: Hoare triple {8936#false} assume true; {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {8936#false} {8936#false} #84#return; {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 49: Hoare triple {8936#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L256 TraceCheckUtils]: 50: Hoare triple {8936#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {8936#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 61: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 62: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 67: Hoare triple {8936#false} assume !(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {8936#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {8936#false} assume true; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {8936#false} {8936#false} #86#return; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {8936#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8936#false} is VALID [2018-11-23 12:13:36,578 INFO L273 TraceCheckUtils]: 72: Hoare triple {8936#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {8936#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {8936#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 75: Hoare triple {8936#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 76: Hoare triple {8936#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 77: Hoare triple {8936#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 78: Hoare triple {8936#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 79: Hoare triple {8936#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8936#false} is VALID [2018-11-23 12:13:36,579 INFO L273 TraceCheckUtils]: 80: Hoare triple {8936#false} assume !(~i~2 < 9); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 81: Hoare triple {8936#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L256 TraceCheckUtils]: 82: Hoare triple {8936#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 83: Hoare triple {8936#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 84: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 85: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 86: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 87: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 88: Hoare triple {8936#false} assume !(~i~1 > 5); {8936#false} is VALID [2018-11-23 12:13:36,580 INFO L273 TraceCheckUtils]: 89: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 90: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 91: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 93: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 94: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 95: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 96: Hoare triple {8936#false} assume !!(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,581 INFO L273 TraceCheckUtils]: 97: Hoare triple {8936#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 98: Hoare triple {8936#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 99: Hoare triple {8936#false} assume !(~i~1 < 10); {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 100: Hoare triple {8936#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 101: Hoare triple {8936#false} assume true; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {8936#false} {8936#false} #88#return; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 103: Hoare triple {8936#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 104: Hoare triple {8936#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8936#false} is VALID [2018-11-23 12:13:36,582 INFO L273 TraceCheckUtils]: 105: Hoare triple {8936#false} assume !false; {8936#false} is VALID [2018-11-23 12:13:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:13:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:13:36,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-11-23 12:13:36,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:36,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:13:36,660 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:13:36,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:13:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:13:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:13:36,661 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 11 states. [2018-11-23 12:13:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,863 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2018-11-23 12:13:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:13:36,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-11-23 12:13:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:13:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:13:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:13:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:13:36,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-23 12:13:36,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:36,949 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:13:36,949 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:13:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:13:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:13:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:13:36,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:36,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:36,983 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:36,984 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:13:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,985 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-23 12:13:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-23 12:13:36,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:36,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:36,987 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:13:36,987 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:13:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:36,989 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-23 12:13:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-23 12:13:36,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:36,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:36,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:36,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:13:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-11-23 12:13:36,992 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 106 [2018-11-23 12:13:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:36,992 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-11-23 12:13:36,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:13:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-23 12:13:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:13:36,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:36,994 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 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, 1, 1, 1] [2018-11-23 12:13:36,994 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1888136856, now seen corresponding path program 15 times [2018-11-23 12:13:36,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:36,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:37,009 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:37,010 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:37,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:37,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:37,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:13:37,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:37,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:37,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {9661#true} call ULTIMATE.init(); {9661#true} is VALID [2018-11-23 12:13:37,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {9661#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9661#true} is VALID [2018-11-23 12:13:37,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {9661#true} assume true; {9661#true} is VALID [2018-11-23 12:13:37,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9661#true} {9661#true} #78#return; {9661#true} is VALID [2018-11-23 12:13:37,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {9661#true} call #t~ret12 := main(); {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {9661#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L256 TraceCheckUtils]: 6: Hoare triple {9661#true} call init_nondet(~#x~0.base, ~#x~0.offset); {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {9661#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {9661#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {9661#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {9661#true} assume !(~i~0 < 10); {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {9661#true} assume true; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9661#true} {9661#true} #82#return; {9661#true} is VALID [2018-11-23 12:13:37,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {9661#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L256 TraceCheckUtils]: 30: Hoare triple {9661#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {9661#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {9661#true} assume !(~i~1 > 5); {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {9661#true} assume !(~i~1 > 5); {9661#true} is VALID [2018-11-23 12:13:37,612 INFO L273 TraceCheckUtils]: 37: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 39: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 40: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 41: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 42: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 44: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 45: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,613 INFO L273 TraceCheckUtils]: 46: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 47: Hoare triple {9661#true} assume !(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 48: Hoare triple {9661#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 49: Hoare triple {9661#true} assume true; {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {9661#true} {9661#true} #84#return; {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 51: Hoare triple {9661#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); {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L256 TraceCheckUtils]: 52: Hoare triple {9661#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {9661#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {9661#true} is VALID [2018-11-23 12:13:37,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {9661#true} assume !(~i~1 > 5); {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 57: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 58: Hoare triple {9661#true} assume !(~i~1 > 5); {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 59: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 60: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 64: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 65: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 66: Hoare triple {9661#true} assume !!(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {9661#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 68: Hoare triple {9661#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 69: Hoare triple {9661#true} assume !(~i~1 < 10); {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 70: Hoare triple {9661#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {9661#true} is VALID [2018-11-23 12:13:37,616 INFO L273 TraceCheckUtils]: 71: Hoare triple {9661#true} assume true; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {9661#true} {9661#true} #86#return; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 73: Hoare triple {9661#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; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 74: Hoare triple {9661#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 75: Hoare triple {9661#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 76: Hoare triple {9661#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 77: Hoare triple {9661#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 78: Hoare triple {9661#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9661#true} is VALID [2018-11-23 12:13:37,617 INFO L273 TraceCheckUtils]: 79: Hoare triple {9661#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9661#true} is VALID [2018-11-23 12:13:37,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {9661#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9661#true} is VALID [2018-11-23 12:13:37,618 INFO L273 TraceCheckUtils]: 81: Hoare triple {9661#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9661#true} is VALID [2018-11-23 12:13:37,618 INFO L273 TraceCheckUtils]: 82: Hoare triple {9661#true} assume !(~i~2 < 9); {9661#true} is VALID [2018-11-23 12:13:37,618 INFO L273 TraceCheckUtils]: 83: Hoare triple {9661#true} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9661#true} is VALID [2018-11-23 12:13:37,618 INFO L256 TraceCheckUtils]: 84: Hoare triple {9661#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {9661#true} is VALID [2018-11-23 12:13:37,620 INFO L273 TraceCheckUtils]: 85: Hoare triple {9661#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {9921#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:37,620 INFO L273 TraceCheckUtils]: 86: Hoare triple {9921#(<= rangesum_~i~1 0)} assume !!(~i~1 < 10); {9921#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:37,622 INFO L273 TraceCheckUtils]: 87: Hoare triple {9921#(<= rangesum_~i~1 0)} assume !(~i~1 > 5); {9921#(<= rangesum_~i~1 0)} is VALID [2018-11-23 12:13:37,622 INFO L273 TraceCheckUtils]: 88: Hoare triple {9921#(<= rangesum_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9931#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:37,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {9931#(<= rangesum_~i~1 1)} assume !!(~i~1 < 10); {9931#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:37,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {9931#(<= rangesum_~i~1 1)} assume !(~i~1 > 5); {9931#(<= rangesum_~i~1 1)} is VALID [2018-11-23 12:13:37,625 INFO L273 TraceCheckUtils]: 91: Hoare triple {9931#(<= rangesum_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9941#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:37,625 INFO L273 TraceCheckUtils]: 92: Hoare triple {9941#(<= rangesum_~i~1 2)} assume !!(~i~1 < 10); {9941#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:37,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {9941#(<= rangesum_~i~1 2)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9941#(<= rangesum_~i~1 2)} is VALID [2018-11-23 12:13:37,626 INFO L273 TraceCheckUtils]: 94: Hoare triple {9941#(<= rangesum_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9951#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:37,626 INFO L273 TraceCheckUtils]: 95: Hoare triple {9951#(<= rangesum_~i~1 3)} assume !!(~i~1 < 10); {9951#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:37,626 INFO L273 TraceCheckUtils]: 96: Hoare triple {9951#(<= rangesum_~i~1 3)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9951#(<= rangesum_~i~1 3)} is VALID [2018-11-23 12:13:37,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {9951#(<= rangesum_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9961#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:13:37,628 INFO L273 TraceCheckUtils]: 98: Hoare triple {9961#(<= rangesum_~i~1 4)} assume !!(~i~1 < 10); {9961#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:13:37,628 INFO L273 TraceCheckUtils]: 99: Hoare triple {9961#(<= rangesum_~i~1 4)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {9961#(<= rangesum_~i~1 4)} is VALID [2018-11-23 12:13:37,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {9961#(<= rangesum_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9971#(<= rangesum_~i~1 5)} is VALID [2018-11-23 12:13:37,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {9971#(<= rangesum_~i~1 5)} assume !(~i~1 < 10); {9662#false} is VALID [2018-11-23 12:13:37,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {9662#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {9662#false} is VALID [2018-11-23 12:13:37,630 INFO L273 TraceCheckUtils]: 103: Hoare triple {9662#false} assume true; {9662#false} is VALID [2018-11-23 12:13:37,630 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {9662#false} {9661#true} #88#return; {9662#false} is VALID [2018-11-23 12:13:37,631 INFO L273 TraceCheckUtils]: 105: Hoare triple {9662#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9662#false} is VALID [2018-11-23 12:13:37,631 INFO L273 TraceCheckUtils]: 106: Hoare triple {9662#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9662#false} is VALID [2018-11-23 12:13:37,631 INFO L273 TraceCheckUtils]: 107: Hoare triple {9662#false} assume !false; {9662#false} is VALID [2018-11-23 12:13:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 178 proven. 35 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-11-23 12:13:37,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:37,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:13:37,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-11-23 12:13:37,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:37,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:13:37,709 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:13:37,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:13:37,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:13:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:37,711 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 8 states. [2018-11-23 12:13:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:37,965 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2018-11-23 12:13:37,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:13:37,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-11-23 12:13:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:13:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:13:37,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2018-11-23 12:13:38,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:38,194 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:13:38,194 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:13:38,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:13:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 12:13:38,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:38,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 12:13:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:13:38,234 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:13:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:38,236 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 12:13:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-23 12:13:38,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:38,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:38,237 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:13:38,237 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:13:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:38,239 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 12:13:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-23 12:13:38,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:38,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:38,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:38,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:13:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-23 12:13:38,243 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 108 [2018-11-23 12:13:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:38,243 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-23 12:13:38,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:13:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-23 12:13:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:13:38,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:38,245 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 18, 9, 9, 9, 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, 1, 1, 1] [2018-11-23 12:13:38,245 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:38,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash 946403736, now seen corresponding path program 16 times [2018-11-23 12:13:38,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:38,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:38,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:38,263 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:38,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:38,263 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:38,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:13:38,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:13:38,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:38,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:38,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {10438#true} call ULTIMATE.init(); {10438#true} is VALID [2018-11-23 12:13:38,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {10438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10438#true} is VALID [2018-11-23 12:13:38,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {10438#true} assume true; {10438#true} is VALID [2018-11-23 12:13:38,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10438#true} {10438#true} #78#return; {10438#true} is VALID [2018-11-23 12:13:38,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {10438#true} call #t~ret12 := main(); {10438#true} is VALID [2018-11-23 12:13:38,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {10438#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {10438#true} is VALID [2018-11-23 12:13:38,813 INFO L256 TraceCheckUtils]: 6: Hoare triple {10438#true} call init_nondet(~#x~0.base, ~#x~0.offset); {10438#true} is VALID [2018-11-23 12:13:38,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {10438#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {10464#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:38,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {10464#(<= init_nondet_~i~0 0)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10464#(<= init_nondet_~i~0 0)} is VALID [2018-11-23 12:13:38,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {10464#(<= init_nondet_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10471#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:38,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {10471#(<= init_nondet_~i~0 1)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10471#(<= init_nondet_~i~0 1)} is VALID [2018-11-23 12:13:38,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {10471#(<= init_nondet_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10478#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:38,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {10478#(<= init_nondet_~i~0 2)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10478#(<= init_nondet_~i~0 2)} is VALID [2018-11-23 12:13:38,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {10478#(<= init_nondet_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10485#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:38,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {10485#(<= init_nondet_~i~0 3)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10485#(<= init_nondet_~i~0 3)} is VALID [2018-11-23 12:13:38,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {10485#(<= init_nondet_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10492#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:38,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {10492#(<= init_nondet_~i~0 4)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10492#(<= init_nondet_~i~0 4)} is VALID [2018-11-23 12:13:38,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {10492#(<= init_nondet_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10499#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:38,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {10499#(<= init_nondet_~i~0 5)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10499#(<= init_nondet_~i~0 5)} is VALID [2018-11-23 12:13:38,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {10499#(<= init_nondet_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10506#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:38,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {10506#(<= init_nondet_~i~0 6)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10506#(<= init_nondet_~i~0 6)} is VALID [2018-11-23 12:13:38,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {10506#(<= init_nondet_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10513#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:38,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {10513#(<= init_nondet_~i~0 7)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10513#(<= init_nondet_~i~0 7)} is VALID [2018-11-23 12:13:38,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {10513#(<= init_nondet_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10520#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:13:38,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {10520#(<= init_nondet_~i~0 8)} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {10520#(<= init_nondet_~i~0 8)} is VALID [2018-11-23 12:13:38,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {10520#(<= init_nondet_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10527#(<= init_nondet_~i~0 9)} is VALID [2018-11-23 12:13:38,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {10527#(<= init_nondet_~i~0 9)} assume !(~i~0 < 10); {10439#false} is VALID [2018-11-23 12:13:38,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {10439#false} assume true; {10439#false} is VALID [2018-11-23 12:13:38,827 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {10439#false} {10438#true} #82#return; {10439#false} is VALID [2018-11-23 12:13:38,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {10439#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {10439#false} is VALID [2018-11-23 12:13:38,828 INFO L256 TraceCheckUtils]: 30: Hoare triple {10439#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {10439#false} is VALID [2018-11-23 12:13:38,828 INFO L273 TraceCheckUtils]: 31: Hoare triple {10439#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {10439#false} is VALID [2018-11-23 12:13:38,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L273 TraceCheckUtils]: 58: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {10439#false} assume !(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L273 TraceCheckUtils]: 60: Hoare triple {10439#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {10439#false} assume true; {10439#false} is VALID [2018-11-23 12:13:38,833 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10439#false} {10439#false} #84#return; {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 63: Hoare triple {10439#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L256 TraceCheckUtils]: 64: Hoare triple {10439#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 65: Hoare triple {10439#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 66: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,834 INFO L273 TraceCheckUtils]: 69: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 70: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 71: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 72: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 77: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 78: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 79: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 80: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,836 INFO L273 TraceCheckUtils]: 81: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,837 INFO L273 TraceCheckUtils]: 82: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,837 INFO L273 TraceCheckUtils]: 83: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,837 INFO L273 TraceCheckUtils]: 84: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,837 INFO L273 TraceCheckUtils]: 85: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,838 INFO L273 TraceCheckUtils]: 86: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,838 INFO L273 TraceCheckUtils]: 87: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,838 INFO L273 TraceCheckUtils]: 88: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,838 INFO L273 TraceCheckUtils]: 89: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,838 INFO L273 TraceCheckUtils]: 90: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,839 INFO L273 TraceCheckUtils]: 91: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,839 INFO L273 TraceCheckUtils]: 92: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {10439#false} assume !(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,839 INFO L273 TraceCheckUtils]: 94: Hoare triple {10439#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {10439#false} is VALID [2018-11-23 12:13:38,839 INFO L273 TraceCheckUtils]: 95: Hoare triple {10439#false} assume true; {10439#false} is VALID [2018-11-23 12:13:38,840 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {10439#false} {10439#false} #86#return; {10439#false} is VALID [2018-11-23 12:13:38,840 INFO L273 TraceCheckUtils]: 97: Hoare triple {10439#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {10439#false} is VALID [2018-11-23 12:13:38,840 INFO L273 TraceCheckUtils]: 98: Hoare triple {10439#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10439#false} is VALID [2018-11-23 12:13:38,840 INFO L273 TraceCheckUtils]: 99: Hoare triple {10439#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10439#false} is VALID [2018-11-23 12:13:38,841 INFO L273 TraceCheckUtils]: 100: Hoare triple {10439#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10439#false} is VALID [2018-11-23 12:13:38,841 INFO L273 TraceCheckUtils]: 101: Hoare triple {10439#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10439#false} is VALID [2018-11-23 12:13:38,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {10439#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10439#false} is VALID [2018-11-23 12:13:38,841 INFO L273 TraceCheckUtils]: 103: Hoare triple {10439#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10439#false} is VALID [2018-11-23 12:13:38,841 INFO L273 TraceCheckUtils]: 104: Hoare triple {10439#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10439#false} is VALID [2018-11-23 12:13:38,842 INFO L273 TraceCheckUtils]: 105: Hoare triple {10439#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10439#false} is VALID [2018-11-23 12:13:38,842 INFO L273 TraceCheckUtils]: 106: Hoare triple {10439#false} assume !(~i~2 < 9); {10439#false} is VALID [2018-11-23 12:13:38,842 INFO L273 TraceCheckUtils]: 107: Hoare triple {10439#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10439#false} is VALID [2018-11-23 12:13:38,842 INFO L256 TraceCheckUtils]: 108: Hoare triple {10439#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {10439#false} is VALID [2018-11-23 12:13:38,843 INFO L273 TraceCheckUtils]: 109: Hoare triple {10439#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {10439#false} is VALID [2018-11-23 12:13:38,843 INFO L273 TraceCheckUtils]: 110: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,843 INFO L273 TraceCheckUtils]: 111: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,843 INFO L273 TraceCheckUtils]: 112: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,843 INFO L273 TraceCheckUtils]: 113: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,844 INFO L273 TraceCheckUtils]: 114: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,844 INFO L273 TraceCheckUtils]: 116: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,844 INFO L273 TraceCheckUtils]: 117: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,845 INFO L273 TraceCheckUtils]: 118: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,845 INFO L273 TraceCheckUtils]: 119: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,845 INFO L273 TraceCheckUtils]: 120: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,845 INFO L273 TraceCheckUtils]: 121: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,845 INFO L273 TraceCheckUtils]: 122: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,846 INFO L273 TraceCheckUtils]: 123: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,846 INFO L273 TraceCheckUtils]: 124: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,846 INFO L273 TraceCheckUtils]: 125: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,846 INFO L273 TraceCheckUtils]: 126: Hoare triple {10439#false} assume !(~i~1 > 5); {10439#false} is VALID [2018-11-23 12:13:38,846 INFO L273 TraceCheckUtils]: 127: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,847 INFO L273 TraceCheckUtils]: 128: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,847 INFO L273 TraceCheckUtils]: 129: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,847 INFO L273 TraceCheckUtils]: 130: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,847 INFO L273 TraceCheckUtils]: 131: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,847 INFO L273 TraceCheckUtils]: 132: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,848 INFO L273 TraceCheckUtils]: 133: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,848 INFO L273 TraceCheckUtils]: 134: Hoare triple {10439#false} assume !!(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,848 INFO L273 TraceCheckUtils]: 135: Hoare triple {10439#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {10439#false} is VALID [2018-11-23 12:13:38,848 INFO L273 TraceCheckUtils]: 136: Hoare triple {10439#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10439#false} is VALID [2018-11-23 12:13:38,848 INFO L273 TraceCheckUtils]: 137: Hoare triple {10439#false} assume !(~i~1 < 10); {10439#false} is VALID [2018-11-23 12:13:38,849 INFO L273 TraceCheckUtils]: 138: Hoare triple {10439#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {10439#false} is VALID [2018-11-23 12:13:38,849 INFO L273 TraceCheckUtils]: 139: Hoare triple {10439#false} assume true; {10439#false} is VALID [2018-11-23 12:13:38,849 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {10439#false} {10439#false} #88#return; {10439#false} is VALID [2018-11-23 12:13:38,849 INFO L273 TraceCheckUtils]: 141: Hoare triple {10439#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10439#false} is VALID [2018-11-23 12:13:38,849 INFO L273 TraceCheckUtils]: 142: Hoare triple {10439#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10439#false} is VALID [2018-11-23 12:13:38,850 INFO L273 TraceCheckUtils]: 143: Hoare triple {10439#false} assume !false; {10439#false} is VALID [2018-11-23 12:13:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-11-23 12:13:38,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:38,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:13:38,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 144 [2018-11-23 12:13:38,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:38,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:13:38,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:38,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:13:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:13:39,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:13:39,000 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 12 states. [2018-11-23 12:13:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:39,414 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-11-23 12:13:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:13:39,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 144 [2018-11-23 12:13:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:13:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2018-11-23 12:13:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:13:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2018-11-23 12:13:39,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 85 transitions. [2018-11-23 12:13:39,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:39,496 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:13:39,497 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:13:39,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:13:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:13:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 12:13:39,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:39,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-23 12:13:39,531 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 12:13:39,531 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 12:13:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:39,533 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-23 12:13:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-11-23 12:13:39,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:39,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:39,535 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 12:13:39,535 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 12:13:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:39,537 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-23 12:13:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-11-23 12:13:39,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:39,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:39,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:39,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:13:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-11-23 12:13:39,540 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 144 [2018-11-23 12:13:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:39,540 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-23 12:13:39,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:13:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-11-23 12:13:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:13:39,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:39,542 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 18, 10, 10, 9, 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, 1, 1, 1] [2018-11-23 12:13:39,542 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:39,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash 901973850, now seen corresponding path program 17 times [2018-11-23 12:13:39,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:39,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:39,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:39,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:39,557 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:39,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:13:39,602 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 12:13:39,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:39,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:39,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {11358#true} call ULTIMATE.init(); {11358#true} is VALID [2018-11-23 12:13:39,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {11358#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11358#true} is VALID [2018-11-23 12:13:39,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {11358#true} assume true; {11358#true} is VALID [2018-11-23 12:13:39,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11358#true} {11358#true} #78#return; {11358#true} is VALID [2018-11-23 12:13:39,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {11358#true} call #t~ret12 := main(); {11358#true} is VALID [2018-11-23 12:13:39,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {11358#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {11358#true} is VALID [2018-11-23 12:13:39,863 INFO L256 TraceCheckUtils]: 6: Hoare triple {11358#true} call init_nondet(~#x~0.base, ~#x~0.offset); {11358#true} is VALID [2018-11-23 12:13:39,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {11358#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {11358#true} is VALID [2018-11-23 12:13:39,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 19: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {11358#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {11358#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {11358#true} assume !(~i~0 < 10); {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {11358#true} assume true; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {11358#true} {11358#true} #82#return; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 31: Hoare triple {11358#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L256 TraceCheckUtils]: 32: Hoare triple {11358#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {11358#true} is VALID [2018-11-23 12:13:39,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {11358#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 34: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {11358#true} assume !(~i~1 > 5); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {11358#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {11358#true} assume !(~i~1 > 5); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {11358#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {11358#true} assume !(~i~1 > 5); {11358#true} is VALID [2018-11-23 12:13:39,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {11358#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {11358#true} assume !(~i~1 > 5); {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {11358#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 46: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 47: Hoare triple {11358#true} assume !(~i~1 > 5); {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {11358#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11358#true} is VALID [2018-11-23 12:13:39,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {11358#true} assume !!(~i~1 < 10); {11358#true} is VALID [2018-11-23 12:13:39,869 INFO L273 TraceCheckUtils]: 50: Hoare triple {11358#true} assume !(~i~1 > 5); {11513#(<= rangesum_~i~1 5)} is VALID [2018-11-23 12:13:39,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {11513#(<= rangesum_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11517#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:39,870 INFO L273 TraceCheckUtils]: 52: Hoare triple {11517#(<= rangesum_~i~1 6)} assume !!(~i~1 < 10); {11517#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:39,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {11517#(<= rangesum_~i~1 6)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11517#(<= rangesum_~i~1 6)} is VALID [2018-11-23 12:13:39,870 INFO L273 TraceCheckUtils]: 54: Hoare triple {11517#(<= rangesum_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11527#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:39,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {11527#(<= rangesum_~i~1 7)} assume !!(~i~1 < 10); {11527#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:39,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {11527#(<= rangesum_~i~1 7)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11527#(<= rangesum_~i~1 7)} is VALID [2018-11-23 12:13:39,871 INFO L273 TraceCheckUtils]: 57: Hoare triple {11527#(<= rangesum_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11537#(<= rangesum_~i~1 8)} is VALID [2018-11-23 12:13:39,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {11537#(<= rangesum_~i~1 8)} assume !!(~i~1 < 10); {11537#(<= rangesum_~i~1 8)} is VALID [2018-11-23 12:13:39,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {11537#(<= rangesum_~i~1 8)} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11537#(<= rangesum_~i~1 8)} is VALID [2018-11-23 12:13:39,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {11537#(<= rangesum_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11547#(<= rangesum_~i~1 9)} is VALID [2018-11-23 12:13:39,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {11547#(<= rangesum_~i~1 9)} assume !(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {11359#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {11359#false} is VALID [2018-11-23 12:13:39,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {11359#false} assume true; {11359#false} is VALID [2018-11-23 12:13:39,875 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11359#false} {11358#true} #84#return; {11359#false} is VALID [2018-11-23 12:13:39,875 INFO L273 TraceCheckUtils]: 65: Hoare triple {11359#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11359#false} is VALID [2018-11-23 12:13:39,875 INFO L256 TraceCheckUtils]: 66: Hoare triple {11359#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {11359#false} is VALID [2018-11-23 12:13:39,875 INFO L273 TraceCheckUtils]: 67: Hoare triple {11359#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {11359#false} is VALID [2018-11-23 12:13:39,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 74: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 77: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 78: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,877 INFO L273 TraceCheckUtils]: 79: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 80: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 83: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 85: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 86: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 87: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,878 INFO L273 TraceCheckUtils]: 88: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 89: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 90: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 91: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 92: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 93: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 94: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 95: Hoare triple {11359#false} assume !(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,879 INFO L273 TraceCheckUtils]: 96: Hoare triple {11359#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 97: Hoare triple {11359#false} assume true; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {11359#false} {11359#false} #86#return; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 99: Hoare triple {11359#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 100: Hoare triple {11359#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 101: Hoare triple {11359#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 102: Hoare triple {11359#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 103: Hoare triple {11359#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 104: Hoare triple {11359#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11359#false} is VALID [2018-11-23 12:13:39,880 INFO L273 TraceCheckUtils]: 105: Hoare triple {11359#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 106: Hoare triple {11359#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 107: Hoare triple {11359#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 108: Hoare triple {11359#false} assume !(~i~2 < 9); {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 109: Hoare triple {11359#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L256 TraceCheckUtils]: 110: Hoare triple {11359#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 111: Hoare triple {11359#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 112: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 113: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,881 INFO L273 TraceCheckUtils]: 114: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 115: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 116: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 117: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 118: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 119: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 120: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 121: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 122: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,882 INFO L273 TraceCheckUtils]: 123: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 124: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 125: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 126: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 127: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 128: Hoare triple {11359#false} assume !(~i~1 > 5); {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 129: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 130: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,883 INFO L273 TraceCheckUtils]: 131: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 132: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 133: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 134: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 135: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 136: Hoare triple {11359#false} assume !!(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 137: Hoare triple {11359#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 138: Hoare triple {11359#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 139: Hoare triple {11359#false} assume !(~i~1 < 10); {11359#false} is VALID [2018-11-23 12:13:39,884 INFO L273 TraceCheckUtils]: 140: Hoare triple {11359#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {11359#false} is VALID [2018-11-23 12:13:39,885 INFO L273 TraceCheckUtils]: 141: Hoare triple {11359#false} assume true; {11359#false} is VALID [2018-11-23 12:13:39,885 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {11359#false} {11359#false} #88#return; {11359#false} is VALID [2018-11-23 12:13:39,885 INFO L273 TraceCheckUtils]: 143: Hoare triple {11359#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11359#false} is VALID [2018-11-23 12:13:39,885 INFO L273 TraceCheckUtils]: 144: Hoare triple {11359#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11359#false} is VALID [2018-11-23 12:13:39,885 INFO L273 TraceCheckUtils]: 145: Hoare triple {11359#false} assume !false; {11359#false} is VALID [2018-11-23 12:13:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 588 proven. 15 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2018-11-23 12:13:39,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:39,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-11-23 12:13:39,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:39,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:39,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:39,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:39,959 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 7 states. [2018-11-23 12:13:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:40,340 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2018-11-23 12:13:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:40,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2018-11-23 12:13:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:13:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2018-11-23 12:13:40,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2018-11-23 12:13:40,418 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:13:40,420 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:13:40,420 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:13:40,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:13:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 12:13:40,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:40,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 12:13:40,455 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:13:40,455 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:13:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:40,458 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-23 12:13:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-23 12:13:40,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:40,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:40,459 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 12:13:40,459 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 12:13:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:40,461 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-23 12:13:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-23 12:13:40,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:40,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:40,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:40,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:13:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-23 12:13:40,464 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 146 [2018-11-23 12:13:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:40,464 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-23 12:13:40,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-23 12:13:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 12:13:40,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:40,465 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1] [2018-11-23 12:13:40,466 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:40,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1171480068, now seen corresponding path program 18 times [2018-11-23 12:13:40,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:40,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:40,480 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:40,480 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:40,480 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:40,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:13:41,518 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:13:41,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:41,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:41,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {12288#true} call ULTIMATE.init(); {12288#true} is VALID [2018-11-23 12:13:41,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {12288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12288#true} is VALID [2018-11-23 12:13:41,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {12288#true} assume true; {12288#true} is VALID [2018-11-23 12:13:41,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12288#true} {12288#true} #78#return; {12288#true} is VALID [2018-11-23 12:13:41,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {12288#true} call #t~ret12 := main(); {12288#true} is VALID [2018-11-23 12:13:41,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {12288#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {12288#true} is VALID [2018-11-23 12:13:41,765 INFO L256 TraceCheckUtils]: 6: Hoare triple {12288#true} call init_nondet(~#x~0.base, ~#x~0.offset); {12288#true} is VALID [2018-11-23 12:13:41,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {12288#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {12288#true} is VALID [2018-11-23 12:13:41,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {12288#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {12288#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {12288#true} assume !(~i~0 < 10); {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {12288#true} assume true; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {12288#true} {12288#true} #82#return; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {12288#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L256 TraceCheckUtils]: 32: Hoare triple {12288#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {12288#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {12288#true} is VALID [2018-11-23 12:13:41,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 41: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 42: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 44: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 47: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 48: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 49: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 53: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 59: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,771 INFO L273 TraceCheckUtils]: 60: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 62: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 63: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 64: Hoare triple {12288#true} assume !(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 65: Hoare triple {12288#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {12288#true} assume true; {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {12288#true} {12288#true} #84#return; {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L273 TraceCheckUtils]: 68: Hoare triple {12288#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); {12288#true} is VALID [2018-11-23 12:13:41,772 INFO L256 TraceCheckUtils]: 69: Hoare triple {12288#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 70: Hoare triple {12288#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 76: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,773 INFO L273 TraceCheckUtils]: 77: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 78: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 79: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 80: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 81: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 82: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 83: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 84: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 85: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,774 INFO L273 TraceCheckUtils]: 86: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 87: Hoare triple {12288#true} assume !(~i~1 > 5); {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 88: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 89: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 90: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 91: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 92: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 93: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 94: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,775 INFO L273 TraceCheckUtils]: 95: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 96: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 97: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 98: Hoare triple {12288#true} assume !!(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 99: Hoare triple {12288#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 100: Hoare triple {12288#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 101: Hoare triple {12288#true} assume !(~i~1 < 10); {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 102: Hoare triple {12288#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L273 TraceCheckUtils]: 103: Hoare triple {12288#true} assume true; {12288#true} is VALID [2018-11-23 12:13:41,776 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {12288#true} {12288#true} #86#return; {12288#true} is VALID [2018-11-23 12:13:41,777 INFO L273 TraceCheckUtils]: 105: Hoare triple {12288#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; {12608#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:41,777 INFO L273 TraceCheckUtils]: 106: Hoare triple {12608#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12608#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:41,778 INFO L273 TraceCheckUtils]: 107: Hoare triple {12608#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12615#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:41,778 INFO L273 TraceCheckUtils]: 108: Hoare triple {12615#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12615#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:41,779 INFO L273 TraceCheckUtils]: 109: Hoare triple {12615#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12622#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:41,779 INFO L273 TraceCheckUtils]: 110: Hoare triple {12622#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12622#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:41,779 INFO L273 TraceCheckUtils]: 111: Hoare triple {12622#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12629#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:41,780 INFO L273 TraceCheckUtils]: 112: Hoare triple {12629#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {12629#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:41,780 INFO L273 TraceCheckUtils]: 113: Hoare triple {12629#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {12636#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:41,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {12636#(<= main_~i~2 4)} assume !(~i~2 < 9); {12289#false} is VALID [2018-11-23 12:13:41,781 INFO L273 TraceCheckUtils]: 115: Hoare triple {12289#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {12289#false} is VALID [2018-11-23 12:13:41,781 INFO L256 TraceCheckUtils]: 116: Hoare triple {12289#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {12289#false} is VALID [2018-11-23 12:13:41,782 INFO L273 TraceCheckUtils]: 117: Hoare triple {12289#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {12289#false} is VALID [2018-11-23 12:13:41,782 INFO L273 TraceCheckUtils]: 118: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,782 INFO L273 TraceCheckUtils]: 119: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,782 INFO L273 TraceCheckUtils]: 120: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,782 INFO L273 TraceCheckUtils]: 121: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 122: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 123: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 124: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 125: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 126: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,783 INFO L273 TraceCheckUtils]: 127: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 128: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 129: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 130: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 131: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 132: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,784 INFO L273 TraceCheckUtils]: 133: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 134: Hoare triple {12289#false} assume !(~i~1 > 5); {12289#false} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 135: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 136: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 137: Hoare triple {12289#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12289#false} is VALID [2018-11-23 12:13:41,785 INFO L273 TraceCheckUtils]: 138: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 139: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 140: Hoare triple {12289#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 141: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 142: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 143: Hoare triple {12289#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 144: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,786 INFO L273 TraceCheckUtils]: 145: Hoare triple {12289#false} assume !!(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 146: Hoare triple {12289#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 147: Hoare triple {12289#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 148: Hoare triple {12289#false} assume !(~i~1 < 10); {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 149: Hoare triple {12289#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 150: Hoare triple {12289#false} assume true; {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {12289#false} {12289#false} #88#return; {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 152: Hoare triple {12289#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {12289#false} is VALID [2018-11-23 12:13:41,787 INFO L273 TraceCheckUtils]: 153: Hoare triple {12289#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12289#false} is VALID [2018-11-23 12:13:41,788 INFO L273 TraceCheckUtils]: 154: Hoare triple {12289#false} assume !false; {12289#false} is VALID [2018-11-23 12:13:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 650 proven. 16 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:13:41,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:41,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:13:41,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2018-11-23 12:13:41,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:41,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:13:41,882 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:13:41,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:13:41,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:13:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:41,883 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 7 states. [2018-11-23 12:13:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,336 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-11-23 12:13:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:13:42,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2018-11-23 12:13:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 12:13:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:13:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2018-11-23 12:13:42,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2018-11-23 12:13:42,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:42,495 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:13:42,496 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:13:42,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:13:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:13:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-11-23 12:13:42,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:42,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 88 states. [2018-11-23 12:13:42,546 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 88 states. [2018-11-23 12:13:42,546 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 88 states. [2018-11-23 12:13:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,548 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 12:13:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 12:13:42,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:42,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:42,549 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 89 states. [2018-11-23 12:13:42,549 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 89 states. [2018-11-23 12:13:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:42,550 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 12:13:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 12:13:42,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:42,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:42,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:13:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-23 12:13:42,553 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 155 [2018-11-23 12:13:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:42,553 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-23 12:13:42,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:13:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-23 12:13:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 12:13:42,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:42,554 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1] [2018-11-23 12:13:42,555 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 157880730, now seen corresponding path program 19 times [2018-11-23 12:13:42,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:42,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:42,570 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:42,570 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:42,570 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:42,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:43,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {13244#true} call ULTIMATE.init(); {13244#true} is VALID [2018-11-23 12:13:43,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {13244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13244#true} is VALID [2018-11-23 12:13:43,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {13244#true} assume true; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13244#true} {13244#true} #78#return; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {13244#true} call #t~ret12 := main(); {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {13244#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L256 TraceCheckUtils]: 6: Hoare triple {13244#true} call init_nondet(~#x~0.base, ~#x~0.offset); {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {13244#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {13244#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {13244#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#true} is VALID [2018-11-23 12:13:43,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {13244#true} assume !(~i~0 < 10); {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {13244#true} assume true; {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {13244#true} {13244#true} #82#return; {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {13244#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L256 TraceCheckUtils]: 32: Hoare triple {13244#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {13244#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 35: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 44: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,435 INFO L273 TraceCheckUtils]: 45: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 46: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 47: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 48: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 49: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 52: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 55: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 58: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 59: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 62: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {13244#true} assume !(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 65: Hoare triple {13244#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 66: Hoare triple {13244#true} assume true; {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {13244#true} {13244#true} #84#return; {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 68: Hoare triple {13244#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); {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L256 TraceCheckUtils]: 69: Hoare triple {13244#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {13244#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {13244#true} is VALID [2018-11-23 12:13:43,438 INFO L273 TraceCheckUtils]: 71: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 73: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 74: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 75: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 76: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 77: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 78: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 79: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,439 INFO L273 TraceCheckUtils]: 80: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 81: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 82: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 83: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 84: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 85: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 86: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 87: Hoare triple {13244#true} assume !(~i~1 > 5); {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,440 INFO L273 TraceCheckUtils]: 89: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 90: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 91: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 92: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 93: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 94: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 95: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 96: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,441 INFO L273 TraceCheckUtils]: 98: Hoare triple {13244#true} assume !!(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L273 TraceCheckUtils]: 99: Hoare triple {13244#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L273 TraceCheckUtils]: 100: Hoare triple {13244#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L273 TraceCheckUtils]: 101: Hoare triple {13244#true} assume !(~i~1 < 10); {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L273 TraceCheckUtils]: 102: Hoare triple {13244#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L273 TraceCheckUtils]: 103: Hoare triple {13244#true} assume true; {13244#true} is VALID [2018-11-23 12:13:43,442 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {13244#true} {13244#true} #86#return; {13244#true} is VALID [2018-11-23 12:13:43,443 INFO L273 TraceCheckUtils]: 105: Hoare triple {13244#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; {13564#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:43,445 INFO L273 TraceCheckUtils]: 106: Hoare triple {13564#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13564#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:43,445 INFO L273 TraceCheckUtils]: 107: Hoare triple {13564#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13571#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:43,447 INFO L273 TraceCheckUtils]: 108: Hoare triple {13571#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13571#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:43,447 INFO L273 TraceCheckUtils]: 109: Hoare triple {13571#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13578#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:43,449 INFO L273 TraceCheckUtils]: 110: Hoare triple {13578#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13578#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:43,449 INFO L273 TraceCheckUtils]: 111: Hoare triple {13578#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13585#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:43,451 INFO L273 TraceCheckUtils]: 112: Hoare triple {13585#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13585#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:43,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {13585#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13592#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:43,453 INFO L273 TraceCheckUtils]: 114: Hoare triple {13592#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {13592#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:43,453 INFO L273 TraceCheckUtils]: 115: Hoare triple {13592#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {13599#(<= main_~i~2 5)} is VALID [2018-11-23 12:13:43,455 INFO L273 TraceCheckUtils]: 116: Hoare triple {13599#(<= main_~i~2 5)} assume !(~i~2 < 9); {13245#false} is VALID [2018-11-23 12:13:43,455 INFO L273 TraceCheckUtils]: 117: Hoare triple {13245#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {13245#false} is VALID [2018-11-23 12:13:43,455 INFO L256 TraceCheckUtils]: 118: Hoare triple {13245#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {13245#false} is VALID [2018-11-23 12:13:43,455 INFO L273 TraceCheckUtils]: 119: Hoare triple {13245#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 120: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 121: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 122: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 123: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 124: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 125: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,456 INFO L273 TraceCheckUtils]: 126: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 127: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 128: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 129: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 130: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 131: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 132: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 133: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 134: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,457 INFO L273 TraceCheckUtils]: 135: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 136: Hoare triple {13245#false} assume !(~i~1 > 5); {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 137: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 138: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 139: Hoare triple {13245#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 140: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 141: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 142: Hoare triple {13245#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13245#false} is VALID [2018-11-23 12:13:43,458 INFO L273 TraceCheckUtils]: 143: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 144: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 145: Hoare triple {13245#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 146: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 147: Hoare triple {13245#false} assume !!(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 148: Hoare triple {13245#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 149: Hoare triple {13245#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 150: Hoare triple {13245#false} assume !(~i~1 < 10); {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 151: Hoare triple {13245#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {13245#false} is VALID [2018-11-23 12:13:43,459 INFO L273 TraceCheckUtils]: 152: Hoare triple {13245#false} assume true; {13245#false} is VALID [2018-11-23 12:13:43,460 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {13245#false} {13245#false} #88#return; {13245#false} is VALID [2018-11-23 12:13:43,460 INFO L273 TraceCheckUtils]: 154: Hoare triple {13245#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {13245#false} is VALID [2018-11-23 12:13:43,460 INFO L273 TraceCheckUtils]: 155: Hoare triple {13245#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13245#false} is VALID [2018-11-23 12:13:43,460 INFO L273 TraceCheckUtils]: 156: Hoare triple {13245#false} assume !false; {13245#false} is VALID [2018-11-23 12:13:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 650 proven. 25 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:13:43,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:13:43,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2018-11-23 12:13:43,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:43,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:13:43,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:43,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:13:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:13:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:43,562 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-11-23 12:13:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,078 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-11-23 12:13:44,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:13:44,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2018-11-23 12:13:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 12:13:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:13:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2018-11-23 12:13:44,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2018-11-23 12:13:44,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:13:44,232 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:13:44,232 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:13:44,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:13:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:13:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 12:13:44,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:44,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 12:13:44,282 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 12:13:44,282 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 12:13:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,285 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-23 12:13:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-23 12:13:44,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:44,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:44,286 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 12:13:44,286 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 12:13:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,288 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-23 12:13:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-11-23 12:13:44,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:44,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:44,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:44,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:13:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 12:13:44,290 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 157 [2018-11-23 12:13:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:44,291 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 12:13:44,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:13:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 12:13:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 12:13:44,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:44,292 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1] [2018-11-23 12:13:44,292 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:44,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2068320696, now seen corresponding path program 20 times [2018-11-23 12:13:44,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:44,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:44,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:44,306 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:44,306 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:44,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:13:44,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:13:44,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:44,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:44,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {14217#true} call ULTIMATE.init(); {14217#true} is VALID [2018-11-23 12:13:44,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {14217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14217#true} is VALID [2018-11-23 12:13:44,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {14217#true} assume true; {14217#true} is VALID [2018-11-23 12:13:44,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14217#true} {14217#true} #78#return; {14217#true} is VALID [2018-11-23 12:13:44,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {14217#true} call #t~ret12 := main(); {14217#true} is VALID [2018-11-23 12:13:44,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {14217#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {14217#true} is VALID [2018-11-23 12:13:44,651 INFO L256 TraceCheckUtils]: 6: Hoare triple {14217#true} call init_nondet(~#x~0.base, ~#x~0.offset); {14217#true} is VALID [2018-11-23 12:13:44,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {14217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {14217#true} is VALID [2018-11-23 12:13:44,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 25: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {14217#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {14217#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {14217#true} assume !(~i~0 < 10); {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {14217#true} assume true; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {14217#true} {14217#true} #82#return; {14217#true} is VALID [2018-11-23 12:13:44,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {14217#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L256 TraceCheckUtils]: 32: Hoare triple {14217#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {14217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 35: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,655 INFO L273 TraceCheckUtils]: 39: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 44: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 47: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,657 INFO L273 TraceCheckUtils]: 52: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 57: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 58: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,658 INFO L273 TraceCheckUtils]: 59: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 62: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 63: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {14217#true} assume !(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,659 INFO L273 TraceCheckUtils]: 65: Hoare triple {14217#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {14217#true} assume true; {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {14217#true} {14217#true} #84#return; {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {14217#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); {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L256 TraceCheckUtils]: 69: Hoare triple {14217#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {14217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {14217#true} is VALID [2018-11-23 12:13:44,660 INFO L273 TraceCheckUtils]: 71: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 72: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 73: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,661 INFO L273 TraceCheckUtils]: 78: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 79: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 80: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 81: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 82: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 83: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,662 INFO L273 TraceCheckUtils]: 84: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 85: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 86: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 87: Hoare triple {14217#true} assume !(~i~1 > 5); {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 88: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 89: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,663 INFO L273 TraceCheckUtils]: 90: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 91: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 92: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 93: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 94: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 95: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,664 INFO L273 TraceCheckUtils]: 96: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 97: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {14217#true} assume !!(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {14217#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {14217#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 101: Hoare triple {14217#true} assume !(~i~1 < 10); {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 102: Hoare triple {14217#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {14217#true} is VALID [2018-11-23 12:13:44,665 INFO L273 TraceCheckUtils]: 103: Hoare triple {14217#true} assume true; {14217#true} is VALID [2018-11-23 12:13:44,666 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {14217#true} {14217#true} #86#return; {14217#true} is VALID [2018-11-23 12:13:44,675 INFO L273 TraceCheckUtils]: 105: Hoare triple {14217#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; {14537#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:44,676 INFO L273 TraceCheckUtils]: 106: Hoare triple {14537#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14537#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:44,676 INFO L273 TraceCheckUtils]: 107: Hoare triple {14537#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14544#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:44,679 INFO L273 TraceCheckUtils]: 108: Hoare triple {14544#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14544#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:44,679 INFO L273 TraceCheckUtils]: 109: Hoare triple {14544#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14551#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:44,680 INFO L273 TraceCheckUtils]: 110: Hoare triple {14551#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14551#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:44,680 INFO L273 TraceCheckUtils]: 111: Hoare triple {14551#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14558#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:44,681 INFO L273 TraceCheckUtils]: 112: Hoare triple {14558#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14558#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:44,681 INFO L273 TraceCheckUtils]: 113: Hoare triple {14558#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14565#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:44,681 INFO L273 TraceCheckUtils]: 114: Hoare triple {14565#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14565#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:44,682 INFO L273 TraceCheckUtils]: 115: Hoare triple {14565#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14572#(<= main_~i~2 5)} is VALID [2018-11-23 12:13:44,682 INFO L273 TraceCheckUtils]: 116: Hoare triple {14572#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {14572#(<= main_~i~2 5)} is VALID [2018-11-23 12:13:44,683 INFO L273 TraceCheckUtils]: 117: Hoare triple {14572#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {14579#(<= main_~i~2 6)} is VALID [2018-11-23 12:13:44,684 INFO L273 TraceCheckUtils]: 118: Hoare triple {14579#(<= main_~i~2 6)} assume !(~i~2 < 9); {14218#false} is VALID [2018-11-23 12:13:44,684 INFO L273 TraceCheckUtils]: 119: Hoare triple {14218#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {14218#false} is VALID [2018-11-23 12:13:44,684 INFO L256 TraceCheckUtils]: 120: Hoare triple {14218#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {14218#false} is VALID [2018-11-23 12:13:44,685 INFO L273 TraceCheckUtils]: 121: Hoare triple {14218#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {14218#false} is VALID [2018-11-23 12:13:44,685 INFO L273 TraceCheckUtils]: 122: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,685 INFO L273 TraceCheckUtils]: 123: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,685 INFO L273 TraceCheckUtils]: 124: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,685 INFO L273 TraceCheckUtils]: 125: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 126: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 127: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 128: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 129: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 130: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,686 INFO L273 TraceCheckUtils]: 131: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 132: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 133: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 134: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 135: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 136: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 137: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 138: Hoare triple {14218#false} assume !(~i~1 > 5); {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 139: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,687 INFO L273 TraceCheckUtils]: 140: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 141: Hoare triple {14218#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 142: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 143: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 144: Hoare triple {14218#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 145: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 146: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 147: Hoare triple {14218#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 148: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,688 INFO L273 TraceCheckUtils]: 149: Hoare triple {14218#false} assume !!(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 150: Hoare triple {14218#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 151: Hoare triple {14218#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 152: Hoare triple {14218#false} assume !(~i~1 < 10); {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 153: Hoare triple {14218#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 154: Hoare triple {14218#false} assume true; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {14218#false} {14218#false} #88#return; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 156: Hoare triple {14218#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 157: Hoare triple {14218#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14218#false} is VALID [2018-11-23 12:13:44,689 INFO L273 TraceCheckUtils]: 158: Hoare triple {14218#false} assume !false; {14218#false} is VALID [2018-11-23 12:13:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:13:44,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:44,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:13:44,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2018-11-23 12:13:44,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:44,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:13:44,770 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:13:44,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:13:44,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:13:44,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:44,771 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 9 states. [2018-11-23 12:13:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:44,930 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2018-11-23 12:13:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:13:44,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2018-11-23 12:13:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 12:13:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:13:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2018-11-23 12:13:44,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2018-11-23 12:13:44,993 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:13:44,996 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:13:44,996 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:13:44,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:13:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:13:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-23 12:13:45,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:13:45,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-23 12:13:45,042 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-23 12:13:45,042 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-23 12:13:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,044 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-23 12:13:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-23 12:13:45,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,045 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-23 12:13:45,045 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-23 12:13:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:45,046 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-23 12:13:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-23 12:13:45,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:13:45,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:13:45,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:13:45,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:13:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:13:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-23 12:13:45,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 159 [2018-11-23 12:13:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:45,049 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-23 12:13:45,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:13:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-23 12:13:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-23 12:13:45,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:45,050 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1, 1, 1] [2018-11-23 12:13:45,050 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:45,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -244874666, now seen corresponding path program 21 times [2018-11-23 12:13:45,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:45,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:13:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:45,063 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:13:45,063 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:13:45,063 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:13:45,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:13:58,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:13:58,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:13:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:58,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:59,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {15207#true} call ULTIMATE.init(); {15207#true} is VALID [2018-11-23 12:13:59,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {15207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15207#true} is VALID [2018-11-23 12:13:59,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {15207#true} assume true; {15207#true} is VALID [2018-11-23 12:13:59,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15207#true} {15207#true} #78#return; {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {15207#true} call #t~ret12 := main(); {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {15207#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L256 TraceCheckUtils]: 6: Hoare triple {15207#true} call init_nondet(~#x~0.base, ~#x~0.offset); {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {15207#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {15207#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {15207#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {15207#true} assume !(~i~0 < 10); {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {15207#true} assume true; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {15207#true} {15207#true} #82#return; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {15207#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L256 TraceCheckUtils]: 32: Hoare triple {15207#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {15207#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 37: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 38: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 39: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 42: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 43: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 45: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 47: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 48: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 49: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 50: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 51: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 52: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,913 INFO L273 TraceCheckUtils]: 53: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 54: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 55: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 56: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 57: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 58: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 59: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 60: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 61: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 63: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 64: Hoare triple {15207#true} assume !(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 65: Hoare triple {15207#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 66: Hoare triple {15207#true} assume true; {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {15207#true} {15207#true} #84#return; {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {15207#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); {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L256 TraceCheckUtils]: 69: Hoare triple {15207#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {15207#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {15207#true} is VALID [2018-11-23 12:13:59,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 73: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 75: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 76: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 77: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 78: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 79: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 81: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 82: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 84: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 85: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 86: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 87: Hoare triple {15207#true} assume !(~i~1 > 5); {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 88: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,917 INFO L273 TraceCheckUtils]: 89: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 90: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 92: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 93: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 94: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 95: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 96: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,918 INFO L273 TraceCheckUtils]: 98: Hoare triple {15207#true} assume !!(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L273 TraceCheckUtils]: 99: Hoare triple {15207#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L273 TraceCheckUtils]: 100: Hoare triple {15207#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L273 TraceCheckUtils]: 101: Hoare triple {15207#true} assume !(~i~1 < 10); {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L273 TraceCheckUtils]: 102: Hoare triple {15207#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L273 TraceCheckUtils]: 103: Hoare triple {15207#true} assume true; {15207#true} is VALID [2018-11-23 12:13:59,919 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {15207#true} {15207#true} #86#return; {15207#true} is VALID [2018-11-23 12:13:59,920 INFO L273 TraceCheckUtils]: 105: Hoare triple {15207#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; {15527#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:59,920 INFO L273 TraceCheckUtils]: 106: Hoare triple {15527#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15527#(<= main_~i~2 0)} is VALID [2018-11-23 12:13:59,920 INFO L273 TraceCheckUtils]: 107: Hoare triple {15527#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15534#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:59,921 INFO L273 TraceCheckUtils]: 108: Hoare triple {15534#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15534#(<= main_~i~2 1)} is VALID [2018-11-23 12:13:59,921 INFO L273 TraceCheckUtils]: 109: Hoare triple {15534#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15541#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:59,921 INFO L273 TraceCheckUtils]: 110: Hoare triple {15541#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15541#(<= main_~i~2 2)} is VALID [2018-11-23 12:13:59,922 INFO L273 TraceCheckUtils]: 111: Hoare triple {15541#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15548#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:59,922 INFO L273 TraceCheckUtils]: 112: Hoare triple {15548#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15548#(<= main_~i~2 3)} is VALID [2018-11-23 12:13:59,923 INFO L273 TraceCheckUtils]: 113: Hoare triple {15548#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15555#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:59,923 INFO L273 TraceCheckUtils]: 114: Hoare triple {15555#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15555#(<= main_~i~2 4)} is VALID [2018-11-23 12:13:59,924 INFO L273 TraceCheckUtils]: 115: Hoare triple {15555#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15562#(<= main_~i~2 5)} is VALID [2018-11-23 12:13:59,924 INFO L273 TraceCheckUtils]: 116: Hoare triple {15562#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15562#(<= main_~i~2 5)} is VALID [2018-11-23 12:13:59,925 INFO L273 TraceCheckUtils]: 117: Hoare triple {15562#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15569#(<= main_~i~2 6)} is VALID [2018-11-23 12:13:59,925 INFO L273 TraceCheckUtils]: 118: Hoare triple {15569#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {15569#(<= main_~i~2 6)} is VALID [2018-11-23 12:13:59,926 INFO L273 TraceCheckUtils]: 119: Hoare triple {15569#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {15576#(<= main_~i~2 7)} is VALID [2018-11-23 12:13:59,927 INFO L273 TraceCheckUtils]: 120: Hoare triple {15576#(<= main_~i~2 7)} assume !(~i~2 < 9); {15208#false} is VALID [2018-11-23 12:13:59,927 INFO L273 TraceCheckUtils]: 121: Hoare triple {15208#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {15208#false} is VALID [2018-11-23 12:13:59,927 INFO L256 TraceCheckUtils]: 122: Hoare triple {15208#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {15208#false} is VALID [2018-11-23 12:13:59,927 INFO L273 TraceCheckUtils]: 123: Hoare triple {15208#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {15208#false} is VALID [2018-11-23 12:13:59,928 INFO L273 TraceCheckUtils]: 124: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,928 INFO L273 TraceCheckUtils]: 125: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,928 INFO L273 TraceCheckUtils]: 126: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,928 INFO L273 TraceCheckUtils]: 127: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,928 INFO L273 TraceCheckUtils]: 128: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,929 INFO L273 TraceCheckUtils]: 129: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,929 INFO L273 TraceCheckUtils]: 130: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,929 INFO L273 TraceCheckUtils]: 131: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,929 INFO L273 TraceCheckUtils]: 132: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,929 INFO L273 TraceCheckUtils]: 133: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 134: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 135: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 136: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 137: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 138: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,930 INFO L273 TraceCheckUtils]: 139: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 140: Hoare triple {15208#false} assume !(~i~1 > 5); {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 141: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 142: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 143: Hoare triple {15208#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 144: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,931 INFO L273 TraceCheckUtils]: 145: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 146: Hoare triple {15208#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 147: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 148: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 149: Hoare triple {15208#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 150: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 151: Hoare triple {15208#false} assume !!(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 152: Hoare triple {15208#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 153: Hoare triple {15208#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {15208#false} is VALID [2018-11-23 12:13:59,932 INFO L273 TraceCheckUtils]: 154: Hoare triple {15208#false} assume !(~i~1 < 10); {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L273 TraceCheckUtils]: 155: Hoare triple {15208#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L273 TraceCheckUtils]: 156: Hoare triple {15208#false} assume true; {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {15208#false} {15208#false} #88#return; {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L273 TraceCheckUtils]: 158: Hoare triple {15208#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L273 TraceCheckUtils]: 159: Hoare triple {15208#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15208#false} is VALID [2018-11-23 12:13:59,933 INFO L273 TraceCheckUtils]: 160: Hoare triple {15208#false} assume !false; {15208#false} is VALID [2018-11-23 12:13:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:13:59,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:13:59,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:13:59,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-11-23 12:13:59,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:13:59,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:14:00,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:00,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:14:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:14:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:00,272 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 10 states. [2018-11-23 12:14:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,672 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-11-23 12:14:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:00,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-11-23 12:14:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2018-11-23 12:14:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2018-11-23 12:14:00,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2018-11-23 12:14:00,767 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:14:00,769 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:14:00,769 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:14:00,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:14:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 12:14:00,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:00,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-23 12:14:00,816 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-23 12:14:00,816 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-23 12:14:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,819 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-23 12:14:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-11-23 12:14:00,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:00,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:00,820 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-23 12:14:00,820 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-23 12:14:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:00,822 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-23 12:14:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-11-23 12:14:00,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:00,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:00,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:00,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:14:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-11-23 12:14:00,825 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 161 [2018-11-23 12:14:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:00,825 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-11-23 12:14:00,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:14:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-11-23 12:14:00,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:14:00,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:00,826 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1, 1, 1] [2018-11-23 12:14:00,827 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:00,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:00,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1567441780, now seen corresponding path program 22 times [2018-11-23 12:14:00,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:00,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:00,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:00,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:00,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:00,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:00,841 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:00,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:14:00,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:14:00,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:01,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:01,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {16214#true} call ULTIMATE.init(); {16214#true} is VALID [2018-11-23 12:14:01,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {16214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16214#true} is VALID [2018-11-23 12:14:01,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {16214#true} assume true; {16214#true} is VALID [2018-11-23 12:14:01,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16214#true} {16214#true} #78#return; {16214#true} is VALID [2018-11-23 12:14:01,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {16214#true} call #t~ret12 := main(); {16214#true} is VALID [2018-11-23 12:14:01,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {16214#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L256 TraceCheckUtils]: 6: Hoare triple {16214#true} call init_nondet(~#x~0.base, ~#x~0.offset); {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {16214#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {16214#true} assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {16214#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {16214#true} assume !(~i~0 < 10); {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {16214#true} assume true; {16214#true} is VALID [2018-11-23 12:14:01,415 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {16214#true} {16214#true} #82#return; {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {16214#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L256 TraceCheckUtils]: 32: Hoare triple {16214#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {16214#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 42: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 61: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 62: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {16214#true} assume !(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {16214#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {16214#true} assume true; {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {16214#true} {16214#true} #84#return; {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 68: Hoare triple {16214#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); {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L256 TraceCheckUtils]: 69: Hoare triple {16214#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 70: Hoare triple {16214#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 71: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 72: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 76: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 78: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 79: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 80: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 82: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,421 INFO L273 TraceCheckUtils]: 83: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 84: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 85: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 86: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 87: Hoare triple {16214#true} assume !(~i~1 > 5); {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 88: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 93: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 94: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 95: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 96: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 97: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 98: Hoare triple {16214#true} assume !!(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {16214#true} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16214#true} is VALID [2018-11-23 12:14:01,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {16214#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16214#true} is VALID [2018-11-23 12:14:01,424 INFO L273 TraceCheckUtils]: 101: Hoare triple {16214#true} assume !(~i~1 < 10); {16214#true} is VALID [2018-11-23 12:14:01,424 INFO L273 TraceCheckUtils]: 102: Hoare triple {16214#true} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {16214#true} is VALID [2018-11-23 12:14:01,424 INFO L273 TraceCheckUtils]: 103: Hoare triple {16214#true} assume true; {16214#true} is VALID [2018-11-23 12:14:01,424 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {16214#true} {16214#true} #86#return; {16214#true} is VALID [2018-11-23 12:14:01,424 INFO L273 TraceCheckUtils]: 105: Hoare triple {16214#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; {16534#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:01,425 INFO L273 TraceCheckUtils]: 106: Hoare triple {16534#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16534#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:01,425 INFO L273 TraceCheckUtils]: 107: Hoare triple {16534#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16541#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:01,426 INFO L273 TraceCheckUtils]: 108: Hoare triple {16541#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16541#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:01,426 INFO L273 TraceCheckUtils]: 109: Hoare triple {16541#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16548#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:01,426 INFO L273 TraceCheckUtils]: 110: Hoare triple {16548#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16548#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:01,427 INFO L273 TraceCheckUtils]: 111: Hoare triple {16548#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16555#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:01,427 INFO L273 TraceCheckUtils]: 112: Hoare triple {16555#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16555#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:01,428 INFO L273 TraceCheckUtils]: 113: Hoare triple {16555#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16562#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:01,428 INFO L273 TraceCheckUtils]: 114: Hoare triple {16562#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16562#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:01,429 INFO L273 TraceCheckUtils]: 115: Hoare triple {16562#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16569#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:01,429 INFO L273 TraceCheckUtils]: 116: Hoare triple {16569#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16569#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:01,430 INFO L273 TraceCheckUtils]: 117: Hoare triple {16569#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16576#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:01,431 INFO L273 TraceCheckUtils]: 118: Hoare triple {16576#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16576#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:01,431 INFO L273 TraceCheckUtils]: 119: Hoare triple {16576#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16583#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:01,432 INFO L273 TraceCheckUtils]: 120: Hoare triple {16583#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {16583#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:01,432 INFO L273 TraceCheckUtils]: 121: Hoare triple {16583#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {16590#(<= main_~i~2 8)} is VALID [2018-11-23 12:14:01,433 INFO L273 TraceCheckUtils]: 122: Hoare triple {16590#(<= main_~i~2 8)} assume !(~i~2 < 9); {16215#false} is VALID [2018-11-23 12:14:01,433 INFO L273 TraceCheckUtils]: 123: Hoare triple {16215#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {16215#false} is VALID [2018-11-23 12:14:01,433 INFO L256 TraceCheckUtils]: 124: Hoare triple {16215#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {16215#false} is VALID [2018-11-23 12:14:01,434 INFO L273 TraceCheckUtils]: 125: Hoare triple {16215#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; {16215#false} is VALID [2018-11-23 12:14:01,434 INFO L273 TraceCheckUtils]: 126: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,434 INFO L273 TraceCheckUtils]: 127: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,434 INFO L273 TraceCheckUtils]: 128: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,434 INFO L273 TraceCheckUtils]: 129: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,435 INFO L273 TraceCheckUtils]: 130: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,435 INFO L273 TraceCheckUtils]: 131: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,435 INFO L273 TraceCheckUtils]: 132: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,435 INFO L273 TraceCheckUtils]: 133: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,436 INFO L273 TraceCheckUtils]: 134: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,436 INFO L273 TraceCheckUtils]: 135: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,436 INFO L273 TraceCheckUtils]: 136: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,436 INFO L273 TraceCheckUtils]: 137: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 138: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 139: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 140: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 141: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 142: Hoare triple {16215#false} assume !(~i~1 > 5); {16215#false} is VALID [2018-11-23 12:14:01,437 INFO L273 TraceCheckUtils]: 143: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 144: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 145: Hoare triple {16215#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 146: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 147: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 148: Hoare triple {16215#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16215#false} is VALID [2018-11-23 12:14:01,438 INFO L273 TraceCheckUtils]: 149: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 150: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 151: Hoare triple {16215#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 152: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 153: Hoare triple {16215#false} assume !!(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 154: Hoare triple {16215#false} assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; {16215#false} is VALID [2018-11-23 12:14:01,439 INFO L273 TraceCheckUtils]: 155: Hoare triple {16215#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L273 TraceCheckUtils]: 156: Hoare triple {16215#false} assume !(~i~1 < 10); {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L273 TraceCheckUtils]: 157: Hoare triple {16215#false} assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L273 TraceCheckUtils]: 158: Hoare triple {16215#false} assume true; {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L268 TraceCheckUtils]: 159: Hoare quadruple {16215#false} {16215#false} #88#return; {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L273 TraceCheckUtils]: 160: Hoare triple {16215#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {16215#false} is VALID [2018-11-23 12:14:01,440 INFO L273 TraceCheckUtils]: 161: Hoare triple {16215#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {16215#false} is VALID [2018-11-23 12:14:01,441 INFO L273 TraceCheckUtils]: 162: Hoare triple {16215#false} assume !false; {16215#false} is VALID [2018-11-23 12:14:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:14:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:14:01,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2018-11-23 12:14:01,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:01,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:01,539 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:14:01,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:01,540 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 11 states. [2018-11-23 12:14:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,733 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-11-23 12:14:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:01,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2018-11-23 12:14:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:01,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:14:01,796 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:14:01,798 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:14:01,798 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:14:01,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:14:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 12:14:01,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:01,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 12:14:01,832 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:14:01,832 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:14:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,834 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-23 12:14:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-11-23 12:14:01,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,835 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:14:01,835 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:14:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:01,837 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-23 12:14:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-11-23 12:14:01,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:01,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:01,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:01,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:14:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-11-23 12:14:01,839 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 163 [2018-11-23 12:14:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:01,840 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-11-23 12:14:01,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-11-23 12:14:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-23 12:14:01,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:01,841 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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, 1, 1, 1, 1, 1] [2018-11-23 12:14:01,841 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:01,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash -553175790, now seen corresponding path program 23 times [2018-11-23 12:14:01,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:01,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:01,853 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:14:01,854 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:14:01,854 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:14:01,869 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:05,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 12:14:05,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 12:14:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:14:05,632 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=11, |#NULL.offset|=13, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=5, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=6, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=6, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=7, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=7, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=8, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=8, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=9, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=9, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 10); VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=(- 2147483644), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] RET #86#return; VAL [main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=(- 2147483644), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=0, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=1, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=2, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=3, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=4, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=5, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=5, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=6, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=6, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=7, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=7, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=8, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=8, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 9); VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483645)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483645)] [?] RET #88#return; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=(- 2147483645), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=13, old(#NULL.base)=11, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L6-L8] assume !(~i~0 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, ~#x~0.base=14, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-2147483644, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !(~i~2 < 9); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=-2147483645, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=13, old(#NULL.base)=11, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L6-L8] assume !(~i~0 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, ~#x~0.base=14, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-2147483644, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !(~i~2 < 9); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=-2147483645, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L31] int x[10]; VAL [x={14:0}] [L32] CALL init_nondet(x) VAL [x={14:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=6, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=7, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=8, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=9, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=10, x={14:0}, x={14:0}] [L6] COND FALSE !(i < 10) VAL [i=10, x={14:0}, x={14:0}] [L32] RET init_nondet(x) VAL [x={14:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={14:0}] [L38] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, x={14:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=-2147483644, temp=-2147483648, x={14:0}] [L41] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, ret=-2147483644, temp=-2147483648, x={14:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=5, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=6, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=7, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=8, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND FALSE !(i<10 -1) VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L46] x[10 -1] = temp VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483645, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450934, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934581, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483645, cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L47] RET, EXPR rangesum(x) VAL [i=9, rangesum(x)=-2147483645, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] [L50] __VERIFIER_error() VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] ----- [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:14:06,015 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:14:06,016 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:14:06,017 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2018-11-23 12:14:06,018 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 12:14:06,019 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2018-11-23 12:14:06,019 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 12:14:06,019 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:14:06,019 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 12:14:06,020 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:14:06,021 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:14:06,021 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:14:06,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:14:06 BoogieIcfgContainer [2018-11-23 12:14:06,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:14:06,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:14:06,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:14:06,025 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:14:06,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:16" (3/4) ... [2018-11-23 12:14:06,028 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=11, |#NULL.offset|=13, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=13] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=5, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=6, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=6, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=7, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=7, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=8, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=8, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=9, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 10);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=9, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 10); VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=10, init_nondet_~x.base=14, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=14, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=(- 2147483644), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483643), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450931), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934577), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483644)] [?] RET #86#return; VAL [main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=(- 2147483644), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=0, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=1, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=2, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=3, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=4, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=5, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=5, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=6, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=6, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=7, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=7, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=8, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=8, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 9); VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=0, rangesum_~i~1=6, rangesum_~ret~0=0, rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=6, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=1, rangesum_~i~1=7, rangesum_~ret~0=(- 2147483645), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=2, rangesum_~i~1=7, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=2, rangesum_~i~1=8, rangesum_~ret~0=(- 4294967288), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=3, rangesum_~i~1=8, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 10); VAL [rangesum_~cnt~0=3, rangesum_~i~1=9, rangesum_~ret~0=(- 6442450934), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 5;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=4, rangesum_~i~1=9, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 10); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483645)] [?] assume true; VAL [rangesum_~cnt~0=4, rangesum_~i~1=10, rangesum_~ret~0=(- 8589934581), rangesum_~x.base=14, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=14, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 2147483645)] [?] RET #88#return; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=(- 2147483645), |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=9, main_~ret2~0=(- 2147483644), main_~ret5~0=(- 2147483645), main_~ret~1=(- 2147483644), main_~temp~0=(- 2147483647), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=14, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=13, old(#NULL.base)=11, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L6-L8] assume !(~i~0 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, ~#x~0.base=14, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-2147483644, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !(~i~2 < 9); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=-2147483645, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=13, old(#NULL.base)=11, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=6, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=7, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=8, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6-L8] assume !!(~i~0 < 10); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=9, ~x.base=14, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L6-L8] assume !(~i~0 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=10, ~x.base=14, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=-2147483644, ~#x~0.base=14, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x.base=14, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=-2147483644, ~#x~0.base=14, ~#x~0.offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !!(~i~2 < 9); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] assume !(~i~2 < 9); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume !(~i~1 > 5); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L17-L22] assume !!(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x.base=14, ~x.offset=0] [L18-L21] assume ~i~1 > 5; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L17-L22] assume !(~i~1 < 10); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=14, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x.base=14, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=-2147483645, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=14, ~#x~0.offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=13, old(#NULL!base)=11, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=6, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=7, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=8, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 10)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=9, ~x!base=14, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=10, ~x!base=14, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=-2147483644, ~#x~0!base=14, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483643, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450931, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483644, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934577, ~x!base=14, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=-2147483644, ~#x~0!base=14, ~#x~0!offset=0, ~ret~1=-2147483644, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=0, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=1, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=2, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=3, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=4, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=5, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=6, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=7, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND FALSE !(!(~i~2 < 9)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=8, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L43-L45] COND TRUE !(~i~2 < 9) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 36 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=4, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND FALSE !(~i~1 > 5) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=5, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=6, ~ret~0=0, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=6, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=7, ~ret~0=-2147483645, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=7, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=8, ~ret~0=-4294967288, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=8, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 10)) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=3, ~i~1=9, ~ret~0=-6442450934, ~x!base=14, ~x!offset=0] [L18] COND TRUE ~i~1 > 5 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=9, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 10) VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=14, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-2147483645, ~cnt~0=4, ~i~1=10, ~ret~0=-8589934581, ~x!base=14, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=-2147483645, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret~1=-2147483644, ~temp~0=-2147483647] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=14, ~#x~0!offset=0, ~i~2=9, ~ret2~0=-2147483644, ~ret5~0=-2147483645, ~ret~1=-2147483644, ~temp~0=-2147483647] [L31] int x[10]; VAL [x={14:0}] [L32] CALL init_nondet(x) VAL [x={14:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=6, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=7, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=8, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=9, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=10, x={14:0}, x={14:0}] [L6] COND FALSE !(i < 10) VAL [i=10, x={14:0}, x={14:0}] [L32] RET init_nondet(x) VAL [x={14:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={14:0}] [L38] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, x={14:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=-2147483644, temp=-2147483648, x={14:0}] [L41] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, ret=-2147483644, temp=-2147483648, x={14:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=5, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=6, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=7, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=8, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND FALSE !(i<10 -1) VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L46] x[10 -1] = temp VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483645, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450934, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934581, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483645, cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L47] RET, EXPR rangesum(x) VAL [i=9, rangesum(x)=-2147483645, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] [L50] __VERIFIER_error() VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] ----- [2018-11-23 12:14:06,232 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 12:14:06,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:14:06,233 INFO L168 Benchmark]: Toolchain (without parser) took 51042.79 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.0 MB). Peak memory consumption was 320.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:14:06,235 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:14:06,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:14:06,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:14:06,235 INFO L168 Benchmark]: Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:14:06,236 INFO L168 Benchmark]: RCFGBuilder took 1046.06 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:14:06,236 INFO L168 Benchmark]: TraceAbstraction took 49355.61 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 392.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 323.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:14:06,236 INFO L168 Benchmark]: Witness Printer took 206.77 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:14:06,239 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 341.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1046.06 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -753.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49355.61 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 392.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 323.4 MB. Max. memory is 7.1 GB. * Witness Printer took 206.77 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[10]; VAL [x={14:0}] [L32] CALL init_nondet(x) VAL [x={14:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=6, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=7, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=8, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=9, x={14:0}, x={14:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=10, x={14:0}, x={14:0}] [L6] COND FALSE !(i < 10) VAL [i=10, x={14:0}, x={14:0}] [L32] RET init_nondet(x) VAL [x={14:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={14:0}] [L38] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, x={14:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=-2147483644, temp=-2147483648, x={14:0}] [L41] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483643, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483643, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450931, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450931, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934577, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483644, cnt=4, i=10, ret=-8589934577, x={14:0}, x={14:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=-2147483644, ret=-2147483644, temp=-2147483648, x={14:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=5, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=6, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=7, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=8, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L43] COND FALSE !(i<10 -1) VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L46] x[10 -1] = temp VAL [i=9, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] CALL, EXPR rangesum(x) VAL [x={14:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-2147483645, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-2147483645, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4294967288, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4294967288, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-6442450934, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-6442450934, x={14:0}, x={14:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8589934581, x={14:0}, x={14:0}] [L17] i++ VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-2147483645, cnt=4, i=10, ret=-8589934581, x={14:0}, x={14:0}] [L47] RET, EXPR rangesum(x) VAL [i=9, rangesum(x)=-2147483645, ret=-2147483644, ret2=-2147483644, temp=-2147483647, x={14:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] [L50] __VERIFIER_error() VAL [i=9, ret=-2147483644, ret2=-2147483644, ret5=-2147483645, temp=-2147483647, x={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 49.2s OverallTime, 28 OverallIterations, 30 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 967 SDtfs, 175 SDslu, 1802 SDs, 0 SdLazy, 401 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2542 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 30 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 19.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2851 NumberOfCodeBlocks, 2320 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 2620 ConstructedInterpolants, 0 QuantifiedInterpolants, 340902 SizeOfPredicates, 26 NumberOfNonLiveVariables, 5818 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 13908/14478 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...