./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4405509d043dde59d941f33192dd2cdce1daabca ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:30:00,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:30:00,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:30:00,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:30:00,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:30:00,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:30:00,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:30:00,724 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:30:00,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:30:00,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:30:00,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:30:00,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:30:00,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:30:00,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:30:00,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:30:00,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:30:00,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:30:00,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:30:00,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:30:00,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:30:00,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:30:00,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:30:00,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:30:00,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:30:00,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:30:00,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:30:00,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:30:00,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:30:00,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:30:00,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:30:00,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:30:00,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:30:00,738 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:30:00,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:30:00,739 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:30:00,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:30:00,740 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:30:00,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:30:00,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:30:00,749 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:30:00,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:30:00,750 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:30:00,751 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:30:00,751 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:30:00,751 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:30:00,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:30:00,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:30:00,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:30:00,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:30:00,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:30:00,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:30:00,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:30:00,755 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4405509d043dde59d941f33192dd2cdce1daabca [2018-11-23 00:30:00,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:30:00,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:30:00,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:30:00,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:30:00,793 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:30:00,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i [2018-11-23 00:30:00,847 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/data/bde54d8d1/e4e85a16193444e5a40bfba61a2ba973/FLAG4b5c66530 [2018-11-23 00:30:01,168 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:30:01,168 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/sv-benchmarks/c/reducercommutativity/rangesum60_false-unreach-call.i [2018-11-23 00:30:01,172 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/data/bde54d8d1/e4e85a16193444e5a40bfba61a2ba973/FLAG4b5c66530 [2018-11-23 00:30:01,181 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/data/bde54d8d1/e4e85a16193444e5a40bfba61a2ba973 [2018-11-23 00:30:01,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:30:01,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:30:01,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:30:01,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:30:01,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:30:01,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6042be87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01, skipping insertion in model container [2018-11-23 00:30:01,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:30:01,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:30:01,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:30:01,347 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:30:01,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:30:01,369 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:30:01,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01 WrapperNode [2018-11-23 00:30:01,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:30:01,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:30:01,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:30:01,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:30:01,375 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:30:01" (1/1) ... [2018-11-23 00:30:01,380 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:30:01" (1/1) ... [2018-11-23 00:30:01,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:30:01,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:30:01,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:30:01,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:30:01,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... [2018-11-23 00:30:01,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:30:01,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:30:01,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:30:01,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:30:01,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:30:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:30:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:30:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:30:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:30:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:30:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:30:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:30:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:30:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 00:30:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 00:30:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:30:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 00:30:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 00:30:01,675 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:30:01,675 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 00:30:01,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:01 BoogieIcfgContainer [2018-11-23 00:30:01,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:30:01,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:30:01,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:30:01,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:30:01,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:30:01" (1/3) ... [2018-11-23 00:30:01,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d2a921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:01, skipping insertion in model container [2018-11-23 00:30:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:01" (2/3) ... [2018-11-23 00:30:01,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d2a921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:01, skipping insertion in model container [2018-11-23 00:30:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:01" (3/3) ... [2018-11-23 00:30:01,680 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum60_false-unreach-call.i [2018-11-23 00:30:01,689 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:30:01,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:30:01,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:30:01,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:30:01,728 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:30:01,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:30:01,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:30:01,728 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:30:01,728 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:30:01,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:30:01,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:30:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 00:30:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:30:01,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:01,743 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 00:30:01,745 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:01,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 00:30:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:01,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:01,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:01,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 00:30:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:01,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:01,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 00:30:01,839 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [55], [59], [61], [62], [68], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:01,863 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:01,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:01,942 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:01,943 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 00:30:01,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:01,957 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:01,992 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 88.89% of their original sizes. [2018-11-23 00:30:01,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:02,022 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-11-23 00:30:02,022 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:02,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:02,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:02,032 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-11-23 00:30:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:02,190 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 00:30:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:02,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 00:30:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:02,197 INFO L225 Difference]: With dead ends: 66 [2018-11-23 00:30:02,198 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 00:30:02,200 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:30:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 00:30:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 00:30:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 00:30:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 00:30:02,226 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 00:30:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:02,226 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 00:30:02,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 00:30:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 00:30:02,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:02,228 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 00:30:02,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:02,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 00:30:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:02,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:02,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:02,242 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:02,242 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:02,243 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:02,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:02,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:02,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 00:30:02,295 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:02,297 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:02,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:02,337 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:02,338 INFO L272 AbstractInterpreter]: Visited 17 different actions 26 times. Merged at 2 different actions 6 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 3. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-11-23 00:30:02,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:02,349 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:02,372 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 85.4% of their original sizes. [2018-11-23 00:30:02,372 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:02,406 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-23 00:30:02,406 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:02,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:02,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:30:02,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:02,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:30:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:30:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:30:02,408 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 7 states. [2018-11-23 00:30:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:02,656 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 00:30:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:30:02,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-23 00:30:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:02,658 INFO L225 Difference]: With dead ends: 54 [2018-11-23 00:30:02,658 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 00:30:02,658 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:30:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 00:30:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 00:30:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 00:30:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 00:30:02,664 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2018-11-23 00:30:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:02,664 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 00:30:02,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:30:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 00:30:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 00:30:02,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:02,666 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 00:30:02,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:02,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2018-11-23 00:30:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:02,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:02,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:02,678 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:02,679 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:02,679 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:02,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:02,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 00:30:02,741 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:02,743 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:02,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:02,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:02,840 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 5 different actions 12 times. Never widened. Performed 185 root evaluator evaluations with a maximum evaluation depth of 10. Performed 185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 3 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-23 00:30:02,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:02,858 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:02,941 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 84.74% of their original sizes. [2018-11-23 00:30:02,941 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:02,989 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 00:30:02,990 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:02,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:30:02,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:02,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:30:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:30:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:30:02,991 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 7 states. [2018-11-23 00:30:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:03,236 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-11-23 00:30:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:30:03,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 00:30:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:03,238 INFO L225 Difference]: With dead ends: 61 [2018-11-23 00:30:03,239 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 00:30:03,239 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:30:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 00:30:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 00:30:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:30:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 00:30:03,248 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2018-11-23 00:30:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:03,248 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 00:30:03,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:30:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 00:30:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 00:30:03,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:03,250 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 00:30:03,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:03,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 00:30:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:03,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:03,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:03,341 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 00:30:03,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:03,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:03,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 00:30:03,342 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:03,343 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:03,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:03,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:03,393 INFO L272 AbstractInterpreter]: Visited 28 different actions 75 times. Merged at 8 different actions 30 times. Widened at 1 different actions 1 times. Performed 323 root evaluator evaluations with a maximum evaluation depth of 3. Performed 323 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-23 00:30:03,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:03,408 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:03,439 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 83.4% of their original sizes. [2018-11-23 00:30:03,439 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:03,542 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 00:30:03,542 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:03,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:30:03,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-23 00:30:03,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:03,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:30:03,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:30:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:03,543 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2018-11-23 00:30:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:04,497 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2018-11-23 00:30:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:30:04,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-23 00:30:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:04,498 INFO L225 Difference]: With dead ends: 74 [2018-11-23 00:30:04,498 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 00:30:04,500 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:30:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 00:30:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-23 00:30:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:30:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 00:30:04,507 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 48 [2018-11-23 00:30:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-23 00:30:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:30:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 00:30:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 00:30:04,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:04,510 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, 1, 1] [2018-11-23 00:30:04,510 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:04,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2018-11-23 00:30:04,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:04,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 00:30:04,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:04,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:04,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 00:30:04,557 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:04,558 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:04,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:04,621 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:04,622 INFO L272 AbstractInterpreter]: Visited 35 different actions 129 times. Merged at 14 different actions 54 times. Widened at 2 different actions 2 times. Performed 550 root evaluator evaluations with a maximum evaluation depth of 3. Performed 550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 7 different actions. Largest state had 25 variables. [2018-11-23 00:30:04,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:04,624 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:04,658 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 81.06% of their original sizes. [2018-11-23 00:30:04,658 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:04,752 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 00:30:04,752 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:04,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:30:04,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-23 00:30:04,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:04,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:30:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:30:04,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:30:04,753 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 14 states. [2018-11-23 00:30:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:05,387 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 00:30:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:30:05,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-11-23 00:30:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:05,388 INFO L225 Difference]: With dead ends: 66 [2018-11-23 00:30:05,388 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 00:30:05,392 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-23 00:30:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 00:30:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-11-23 00:30:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:30:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 00:30:05,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 50 [2018-11-23 00:30:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:05,401 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 00:30:05,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:30:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 00:30:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 00:30:05,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:05,402 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1] [2018-11-23 00:30:05,402 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:05,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 395797120, now seen corresponding path program 1 times [2018-11-23 00:30:05,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:05,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:05,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 00:30:05,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:05,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:05,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 00:30:05,423 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:05,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:05,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:05,699 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:30:05,699 INFO L272 AbstractInterpreter]: Visited 30 different actions 155 times. Merged at 14 different actions 73 times. Widened at 1 different actions 3 times. Performed 690 root evaluator evaluations with a maximum evaluation depth of 10. Performed 690 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 23 fixpoints after 8 different actions. Largest state had 23 variables. [2018-11-23 00:30:05,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:05,701 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:30:05,728 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 86.31% of their original sizes. [2018-11-23 00:30:05,728 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:30:05,776 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-23 00:30:05,777 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:30:05,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:05,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:30:05,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:05,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:30:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:30:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:30:05,778 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-11-23 00:30:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:05,927 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-23 00:30:05,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:30:05,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 00:30:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:05,928 INFO L225 Difference]: With dead ends: 73 [2018-11-23 00:30:05,928 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 00:30:05,928 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:30:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 00:30:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 00:30:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 00:30:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-11-23 00:30:05,935 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 51 [2018-11-23 00:30:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:05,936 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-11-23 00:30:05,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:30:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-11-23 00:30:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 00:30:05,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:05,938 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-23 00:30:05,938 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:05,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -515269076, now seen corresponding path program 1 times [2018-11-23 00:30:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:05,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:05,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 00:30:05,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:05,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:05,957 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 00:30:05,957 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:05,958 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:05,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:06,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:06,248 INFO L272 AbstractInterpreter]: Visited 38 different actions 241 times. Merged at 22 different actions 118 times. Widened at 2 different actions 4 times. Performed 1053 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1053 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 34 fixpoints after 12 different actions. Largest state had 25 variables. [2018-11-23 00:30:06,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:06,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:06,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:06,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:06,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:06,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 00:30:06,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 00:30:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 00:30:06,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:06,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:30:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:30:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:30:06,408 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 6 states. [2018-11-23 00:30:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:06,429 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-11-23 00:30:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:30:06,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-23 00:30:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:06,433 INFO L225 Difference]: With dead ends: 95 [2018-11-23 00:30:06,434 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 00:30:06,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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 00:30:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 00:30:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 00:30:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 00:30:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 00:30:06,442 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-11-23 00:30:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:06,443 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 00:30:06,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:30:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 00:30:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 00:30:06,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:06,445 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2018-11-23 00:30:06,445 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:06,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -871058906, now seen corresponding path program 2 times [2018-11-23 00:30:06,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:06,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:06,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 00:30:06,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:06,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:06,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:06,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:06,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:06,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:06,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:06,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:06,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 00:30:06,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:06,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 00:30:06,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 00:30:06,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:06,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 00:30:06,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:06,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:30:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:30:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:30:06,589 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-11-23 00:30:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:06,613 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-11-23 00:30:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:30:06,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 00:30:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:06,615 INFO L225 Difference]: With dead ends: 104 [2018-11-23 00:30:06,615 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 00:30:06,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 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 00:30:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 00:30:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 00:30:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 00:30:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-11-23 00:30:06,622 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 59 [2018-11-23 00:30:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:06,622 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-11-23 00:30:06,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:30:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-11-23 00:30:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 00:30:06,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:06,623 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 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 00:30:06,623 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:06,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1442887404, now seen corresponding path program 1 times [2018-11-23 00:30:06,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:06,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:06,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:06,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:06,634 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:06,635 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:06,635 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:06,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:06,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:06,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-11-23 00:30:06,694 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 00:30:06,695 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:06,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:06,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:06,971 INFO L272 AbstractInterpreter]: Visited 37 different actions 167 times. Merged at 17 different actions 71 times. Widened at 2 different actions 3 times. Performed 707 root evaluator evaluations with a maximum evaluation depth of 10. Performed 707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 20 fixpoints after 9 different actions. Largest state had 25 variables. [2018-11-23 00:30:06,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:06,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:06,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:06,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:06,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:06,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:07,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 00:30:07,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 00:30:07,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:07,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 00:30:07,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:30:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:30:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:07,153 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 12 states. [2018-11-23 00:30:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:07,180 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-11-23 00:30:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:30:07,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 00:30:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:07,185 INFO L225 Difference]: With dead ends: 127 [2018-11-23 00:30:07,185 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 00:30:07,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 00:30:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 00:30:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 00:30:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-23 00:30:07,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 101 [2018-11-23 00:30:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:07,193 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-23 00:30:07,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:30:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-23 00:30:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 00:30:07,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:07,194 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 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 00:30:07,194 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:07,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -992722080, now seen corresponding path program 2 times [2018-11-23 00:30:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:07,208 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:07,208 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:07,208 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:07,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:07,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:07,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:07,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:07,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:07,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:07,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:07,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:07,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 00:30:07,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:07,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 00:30:07,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-11-23 00:30:07,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:07,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 00:30:07,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:07,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:30:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:30:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:30:07,375 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2018-11-23 00:30:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:07,393 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-11-23 00:30:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:30:07,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-23 00:30:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:07,396 INFO L225 Difference]: With dead ends: 123 [2018-11-23 00:30:07,396 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 00:30:07,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 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 00:30:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 00:30:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 00:30:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 00:30:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-11-23 00:30:07,407 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 113 [2018-11-23 00:30:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:07,408 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-11-23 00:30:07,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:30:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-11-23 00:30:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 00:30:07,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:07,410 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 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] [2018-11-23 00:30:07,410 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:07,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash -748407238, now seen corresponding path program 3 times [2018-11-23 00:30:07,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:07,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:07,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:07,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:07,423 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:07,423 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:07,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:07,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:07,469 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:07,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:07,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:07,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:07,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:30:07,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:30:07,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:30:07,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:07,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 00:30:07,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 00:30:07,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 00:30:07,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:07,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 00:30:07,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 00:30:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:07,729 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 24 states. [2018-11-23 00:30:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:07,772 INFO L93 Difference]: Finished difference Result 175 states and 218 transitions. [2018-11-23 00:30:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 00:30:07,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2018-11-23 00:30:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:07,774 INFO L225 Difference]: With dead ends: 175 [2018-11-23 00:30:07,774 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 00:30:07,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 00:30:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 00:30:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 00:30:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-11-23 00:30:07,785 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 119 [2018-11-23 00:30:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:07,785 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-11-23 00:30:07,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 00:30:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-11-23 00:30:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-23 00:30:07,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:07,787 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 18, 18, 15, 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] [2018-11-23 00:30:07,787 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:07,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1957844770, now seen corresponding path program 4 times [2018-11-23 00:30:07,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:07,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:07,807 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:07,807 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:07,807 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:07,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:07,859 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:07,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:07,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:07,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:07,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:07,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 00:30:08,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 00:30:08,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:08,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 00:30:08,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 00:30:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 00:30:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 00:30:08,572 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 48 states. [2018-11-23 00:30:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:08,663 INFO L93 Difference]: Finished difference Result 223 states and 278 transitions. [2018-11-23 00:30:08,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 00:30:08,664 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 143 [2018-11-23 00:30:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:08,665 INFO L225 Difference]: With dead ends: 223 [2018-11-23 00:30:08,665 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 00:30:08,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 00:30:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 00:30:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-23 00:30:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 00:30:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2018-11-23 00:30:08,675 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 143 [2018-11-23 00:30:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:08,675 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2018-11-23 00:30:08,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 00:30:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2018-11-23 00:30:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-23 00:30:08,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:08,677 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 18, 18, 15, 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] [2018-11-23 00:30:08,677 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:08,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1230507790, now seen corresponding path program 5 times [2018-11-23 00:30:08,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:08,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:08,703 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:08,703 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:08,703 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:08,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:08,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:08,771 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:08,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:08,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:08,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:08,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:08,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 00:30:08,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:08,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-11-23 00:30:08,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 271 proven. 2 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-11-23 00:30:08,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:08,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 00:30:08,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:08,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:30:08,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:30:08,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:30:08,889 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand 6 states. [2018-11-23 00:30:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:08,904 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2018-11-23 00:30:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:30:08,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2018-11-23 00:30:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:08,905 INFO L225 Difference]: With dead ends: 228 [2018-11-23 00:30:08,905 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 00:30:08,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 377 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 00:30:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 00:30:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-11-23 00:30:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 00:30:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-11-23 00:30:08,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 191 [2018-11-23 00:30:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:08,913 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-11-23 00:30:08,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:30:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-11-23 00:30:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-23 00:30:08,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:08,915 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 27, 27, 15, 12, 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 00:30:08,915 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:08,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:08,915 INFO L82 PathProgramCache]: Analyzing trace with hash -244392990, now seen corresponding path program 6 times [2018-11-23 00:30:08,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:08,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:08,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:08,939 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:08,940 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:08,940 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:08,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:08,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:09,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:09,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:09,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:09,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:30:09,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:30:09,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:30:09,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:09,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-11-23 00:30:09,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-11-23 00:30:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 62 [2018-11-23 00:30:10,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:10,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 00:30:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 00:30:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 00:30:10,714 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 62 states. [2018-11-23 00:30:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:10,824 INFO L93 Difference]: Finished difference Result 269 states and 314 transitions. [2018-11-23 00:30:10,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 00:30:10,825 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 218 [2018-11-23 00:30:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:10,826 INFO L225 Difference]: With dead ends: 269 [2018-11-23 00:30:10,826 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 00:30:10,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 341 SyntacticMatches, 34 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 00:30:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 00:30:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-23 00:30:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 00:30:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-11-23 00:30:10,836 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 218 [2018-11-23 00:30:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:10,836 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-11-23 00:30:10,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 00:30:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-11-23 00:30:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-23 00:30:10,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:10,839 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 27, 27, 15, 12, 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 00:30:10,839 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:10,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1334240254, now seen corresponding path program 7 times [2018-11-23 00:30:10,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:10,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:10,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:10,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:10,864 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:10,864 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:10,864 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:10,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:10,967 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:10,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:10,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:10,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:10,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:11,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2018-11-23 00:30:11,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4765 backedges. 65 proven. 556 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2018-11-23 00:30:11,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:11,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 00:30:11,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:11,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:30:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:30:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:11,222 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 12 states. [2018-11-23 00:30:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:11,260 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2018-11-23 00:30:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:30:11,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-11-23 00:30:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:11,262 INFO L225 Difference]: With dead ends: 283 [2018-11-23 00:30:11,262 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 00:30:11,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 00:30:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-23 00:30:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 00:30:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 233 transitions. [2018-11-23 00:30:11,276 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 233 transitions. Word has length 246 [2018-11-23 00:30:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:11,276 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 233 transitions. [2018-11-23 00:30:11,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:30:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 233 transitions. [2018-11-23 00:30:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-23 00:30:11,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:11,278 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 45, 45, 30, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:11,278 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash 224869374, now seen corresponding path program 8 times [2018-11-23 00:30:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:11,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:11,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:11,302 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:11,302 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:11,302 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:11,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:11,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:11,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:11,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:11,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:11,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:11,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:11,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:11,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 00:30:11,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:11,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6736 backedges. 1420 proven. 16 refuted. 0 times theorem prover too weak. 5300 trivial. 0 not checked. [2018-11-23 00:30:11,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6736 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6720 trivial. 0 not checked. [2018-11-23 00:30:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:11,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 00:30:11,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:11,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 00:30:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:30:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:11,567 INFO L87 Difference]: Start difference. First operand 217 states and 233 transitions. Second operand 12 states. [2018-11-23 00:30:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:11,612 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2018-11-23 00:30:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:30:11,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 300 [2018-11-23 00:30:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:11,622 INFO L225 Difference]: With dead ends: 301 [2018-11-23 00:30:11,622 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 00:30:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:30:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 00:30:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-11-23 00:30:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-23 00:30:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 257 transitions. [2018-11-23 00:30:11,639 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 257 transitions. Word has length 300 [2018-11-23 00:30:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:11,640 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 257 transitions. [2018-11-23 00:30:11,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 00:30:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2018-11-23 00:30:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-23 00:30:11,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:11,642 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 45, 45, 30, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:11,642 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:11,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1007494070, now seen corresponding path program 9 times [2018-11-23 00:30:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:11,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:11,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:11,670 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:11,670 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:11,670 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:11,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:11,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:11,764 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:11,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:11,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:30:11,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:30:11,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:30:11,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:11,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 1567 proven. 155 refuted. 0 times theorem prover too weak. 5098 trivial. 0 not checked. [2018-11-23 00:30:11,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 1567 proven. 155 refuted. 0 times theorem prover too weak. 5098 trivial. 0 not checked. [2018-11-23 00:30:12,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:12,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 00:30:12,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:12,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 00:30:12,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 00:30:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:12,127 INFO L87 Difference]: Start difference. First operand 241 states and 257 transitions. Second operand 24 states. [2018-11-23 00:30:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:12,195 INFO L93 Difference]: Finished difference Result 385 states and 435 transitions. [2018-11-23 00:30:12,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 00:30:12,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 312 [2018-11-23 00:30:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:12,197 INFO L225 Difference]: With dead ends: 385 [2018-11-23 00:30:12,197 INFO L226 Difference]: Without dead ends: 277 [2018-11-23 00:30:12,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-23 00:30:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-11-23 00:30:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-23 00:30:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 293 transitions. [2018-11-23 00:30:12,216 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 293 transitions. Word has length 312 [2018-11-23 00:30:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:12,216 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 293 transitions. [2018-11-23 00:30:12,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 00:30:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 293 transitions. [2018-11-23 00:30:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-23 00:30:12,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:12,219 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 66, 60, 60, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:12,219 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:12,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1832053174, now seen corresponding path program 10 times [2018-11-23 00:30:12,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:12,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:12,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:12,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:12,246 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:12,246 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:12,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:12,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:12,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:12,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:12,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:12,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:12,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:12,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 13678 backedges. 4037 proven. 737 refuted. 0 times theorem prover too weak. 8904 trivial. 0 not checked. [2018-11-23 00:30:12,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13678 backedges. 317 proven. 5227 refuted. 0 times theorem prover too weak. 8134 trivial. 0 not checked. [2018-11-23 00:30:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:13,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 33 [2018-11-23 00:30:13,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:13,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 00:30:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 00:30:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 00:30:13,095 INFO L87 Difference]: Start difference. First operand 277 states and 293 transitions. Second operand 33 states. [2018-11-23 00:30:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:13,172 INFO L93 Difference]: Finished difference Result 448 states and 495 transitions. [2018-11-23 00:30:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 00:30:13,176 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 420 [2018-11-23 00:30:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:13,178 INFO L225 Difference]: With dead ends: 448 [2018-11-23 00:30:13,178 INFO L226 Difference]: Without dead ends: 304 [2018-11-23 00:30:13,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 793 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 00:30:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-23 00:30:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2018-11-23 00:30:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 00:30:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 320 transitions. [2018-11-23 00:30:13,189 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 320 transitions. Word has length 420 [2018-11-23 00:30:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:13,189 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 320 transitions. [2018-11-23 00:30:13,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 00:30:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 320 transitions. [2018-11-23 00:30:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-11-23 00:30:13,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:13,192 INFO L402 BasicCegarLoop]: trace histogram [108, 108, 93, 60, 60, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:13,192 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:13,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1098274954, now seen corresponding path program 11 times [2018-11-23 00:30:13,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:13,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:13,215 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:13,215 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:13,216 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:13,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:13,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:13,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:13,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:13,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:13,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:13,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:13,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:13,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 00:30:13,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:13,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21373 backedges. 1763 proven. 40 refuted. 0 times theorem prover too weak. 19570 trivial. 0 not checked. [2018-11-23 00:30:13,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21373 backedges. 1763 proven. 40 refuted. 0 times theorem prover too weak. 19570 trivial. 0 not checked. [2018-11-23 00:30:13,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:13,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 00:30:13,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:13,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 00:30:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 00:30:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:30:13,923 INFO L87 Difference]: Start difference. First operand 304 states and 320 transitions. Second operand 16 states. [2018-11-23 00:30:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:13,988 INFO L93 Difference]: Finished difference Result 499 states and 553 transitions. [2018-11-23 00:30:13,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 00:30:13,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 501 [2018-11-23 00:30:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:13,998 INFO L225 Difference]: With dead ends: 499 [2018-11-23 00:30:13,998 INFO L226 Difference]: Without dead ends: 328 [2018-11-23 00:30:13,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:30:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-23 00:30:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-23 00:30:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 00:30:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 352 transitions. [2018-11-23 00:30:14,011 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 352 transitions. Word has length 501 [2018-11-23 00:30:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:14,012 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 352 transitions. [2018-11-23 00:30:14,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 00:30:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 352 transitions. [2018-11-23 00:30:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-11-23 00:30:14,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:14,015 INFO L402 BasicCegarLoop]: trace histogram [132, 132, 93, 60, 60, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:14,015 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:14,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1655785354, now seen corresponding path program 12 times [2018-11-23 00:30:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:14,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:14,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:14,032 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:14,032 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:14,032 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/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 00:30:14,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:14,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:14,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:14,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:14,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:14,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:30:14,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:30:14,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:30:14,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:14,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30049 backedges. 11800 proven. 2882 refuted. 0 times theorem prover too weak. 15367 trivial. 0 not checked. [2018-11-23 00:30:14,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30049 backedges. 11800 proven. 2882 refuted. 0 times theorem prover too weak. 15367 trivial. 0 not checked. [2018-11-23 00:30:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:15,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 62 [2018-11-23 00:30:15,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:15,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-23 00:30:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-23 00:30:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 00:30:15,811 INFO L87 Difference]: Start difference. First operand 328 states and 352 transitions. Second operand 62 states. [2018-11-23 00:30:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:16,062 INFO L93 Difference]: Finished difference Result 571 states and 657 transitions. [2018-11-23 00:30:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 00:30:16,063 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 573 [2018-11-23 00:30:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:16,065 INFO L225 Difference]: With dead ends: 571 [2018-11-23 00:30:16,065 INFO L226 Difference]: Without dead ends: 376 [2018-11-23 00:30:16,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1055 SyntacticMatches, 30 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 00:30:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-23 00:30:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-11-23 00:30:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 00:30:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 416 transitions. [2018-11-23 00:30:16,083 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 416 transitions. Word has length 573 [2018-11-23 00:30:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:16,083 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 416 transitions. [2018-11-23 00:30:16,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-23 00:30:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 416 transitions. [2018-11-23 00:30:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2018-11-23 00:30:16,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:16,088 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:16,088 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:16,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1948375670, now seen corresponding path program 13 times [2018-11-23 00:30:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:16,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:16,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:16,116 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:16,116 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:16,116 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:16,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:16,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:16,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:16,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:16,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:16,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:16,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:16,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 52585 backedges. 21850 proven. 100 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-11-23 00:30:16,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 52585 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-11-23 00:30:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:16,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 00:30:16,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:16,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 00:30:16,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 00:30:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:16,831 INFO L87 Difference]: Start difference. First operand 376 states and 416 transitions. Second operand 24 states. [2018-11-23 00:30:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:16,910 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2018-11-23 00:30:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 00:30:16,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 717 [2018-11-23 00:30:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:16,913 INFO L225 Difference]: With dead ends: 619 [2018-11-23 00:30:16,913 INFO L226 Difference]: Without dead ends: 424 [2018-11-23 00:30:16,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1433 GetRequests, 1411 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 00:30:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-23 00:30:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-11-23 00:30:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-23 00:30:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 464 transitions. [2018-11-23 00:30:16,936 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 464 transitions. Word has length 717 [2018-11-23 00:30:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 464 transitions. [2018-11-23 00:30:16,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 00:30:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 464 transitions. [2018-11-23 00:30:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2018-11-23 00:30:16,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:16,942 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 22, 22, 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 00:30:16,942 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:16,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:16,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1996731378, now seen corresponding path program 14 times [2018-11-23 00:30:16,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:16,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:16,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:16,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:16,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:16,972 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:16,972 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:16,972 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:16,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:16,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:17,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:17,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:17,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:17,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:17,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:30:17,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:30:25,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-23 00:30:25,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:25,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 52969 backedges. 21850 proven. 484 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-11-23 00:30:26,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52969 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-11-23 00:30:26,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:26,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 00:30:26,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:26,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 00:30:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 00:30:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 00:30:26,711 INFO L87 Difference]: Start difference. First operand 424 states and 464 transitions. Second operand 48 states. [2018-11-23 00:30:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:26,820 INFO L93 Difference]: Finished difference Result 715 states and 834 transitions. [2018-11-23 00:30:26,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 00:30:26,828 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 741 [2018-11-23 00:30:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:26,831 INFO L225 Difference]: With dead ends: 715 [2018-11-23 00:30:26,831 INFO L226 Difference]: Without dead ends: 520 [2018-11-23 00:30:26,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1435 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 00:30:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-11-23 00:30:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2018-11-23 00:30:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 00:30:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 560 transitions. [2018-11-23 00:30:26,859 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 560 transitions. Word has length 741 [2018-11-23 00:30:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:26,860 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 560 transitions. [2018-11-23 00:30:26,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 00:30:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 560 transitions. [2018-11-23 00:30:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2018-11-23 00:30:26,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:26,865 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 46, 46, 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 00:30:26,866 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:26,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1375119554, now seen corresponding path program 15 times [2018-11-23 00:30:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:26,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:26,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:26,893 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:26,893 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:26,893 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:26,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:26,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:27,052 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:30:27,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 00:30:27,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:27,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:27,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:30:27,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 00:30:27,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:30:27,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:30:27,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 54601 backedges. 21850 proven. 2116 refuted. 0 times theorem prover too weak. 30635 trivial. 0 not checked. [2018-11-23 00:30:27,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 54601 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 52485 trivial. 0 not checked. [2018-11-23 00:30:28,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:30:28,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 61 [2018-11-23 00:30:28,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 00:30:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 00:30:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 00:30:28,938 INFO L87 Difference]: Start difference. First operand 520 states and 560 transitions. Second operand 61 states. [2018-11-23 00:30:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:29,050 INFO L93 Difference]: Finished difference Result 767 states and 864 transitions. [2018-11-23 00:30:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-23 00:30:29,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 789 [2018-11-23 00:30:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:29,052 INFO L225 Difference]: With dead ends: 767 [2018-11-23 00:30:29,052 INFO L226 Difference]: Without dead ends: 572 [2018-11-23 00:30:29,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1577 GetRequests, 1483 SyntacticMatches, 35 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 00:30:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-11-23 00:30:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2018-11-23 00:30:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-11-23 00:30:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 612 transitions. [2018-11-23 00:30:29,071 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 612 transitions. Word has length 789 [2018-11-23 00:30:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 612 transitions. [2018-11-23 00:30:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-11-23 00:30:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 612 transitions. [2018-11-23 00:30:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2018-11-23 00:30:29,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:29,076 INFO L402 BasicCegarLoop]: trace histogram [180, 180, 93, 87, 60, 60, 59, 59, 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 00:30:29,077 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:29,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:29,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1414170696, now seen corresponding path program 16 times [2018-11-23 00:30:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:29,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:30:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:29,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:29,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:30:29,096 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:30:29,096 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ba7770eb-11ab-48f5-a25c-e9d116a582d9/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:30:29,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:29,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:30:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 00:30:31,254 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-11-23 00:30:31,254 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] assume true; [?] RET #78#return; [?] CALL call #t~ret12 := main(); [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 60);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !(~i~0 < 60); [?] assume true; [?] RET #82#return; [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 60); [?] 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); [?] assume true; [?] RET #84#return; [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 60); [?] 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); [?] assume true; [?] RET #86#return; [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 59);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !(~i~2 < 59); [?] call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~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; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume !(~i~1 > 30); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 60); [?] assume ~i~1 > 30;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; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 60); [?] 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); [?] assume true; [?] RET #88#return; [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [?] assume !false; [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 60); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [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); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 59); [L46] call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 60); [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 60); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [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); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 59); [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 59); [L46] call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [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; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume !(~i~1 > 30); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 60); [L18-L21] assume ~i~1 > 30; [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 60); [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); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 60) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L38] RET call #t~ret4 := rangesum(~#x~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); [L41] CALL call #t~ret7 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L41] RET call #t~ret7 := rangesum(~#x~0); [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; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 59) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 236 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 60) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L38] RET call #t~ret4 := rangesum(~#x~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); [L41] CALL call #t~ret7 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L41] RET call #t~ret7 := rangesum(~#x~0); [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; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 59) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 236 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 60) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L38] RET call #t~ret4 := rangesum(~#x~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); [L41] CALL call #t~ret7 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L41] RET call #t~ret7 := rangesum(~#x~0); [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; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 59) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 236 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(240); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 60)) [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; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 60) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L38] RET call #t~ret4 := rangesum(~#x~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); [L41] CALL call #t~ret7 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L41] RET call #t~ret7 := rangesum(~#x~0); [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; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 59)) [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; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 59) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 236 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~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; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND FALSE !(~i~1 > 30) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 60)) [L18] COND TRUE ~i~1 > 30 [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; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 60) [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); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [L31] int x[60]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 60) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [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 [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<60 -1) [L46] x[60 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() ----- [2018-11-23 00:30:38,399 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-11-23 00:30:38,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:30:38 BoogieIcfgContainer [2018-11-23 00:30:38,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:30:38,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:30:38,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:30:38,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:30:38,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:01" (3/4) ... [2018-11-23 00:30:38,457 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:30:38,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:30:38,458 INFO L168 Benchmark]: Toolchain (without parser) took 37274.70 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 851.4 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -94.1 MB). Peak memory consumption was 757.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:30:38,459 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:30:38,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:30:38,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:30:38,460 INFO L168 Benchmark]: Boogie Preprocessor took 54.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:30:38,460 INFO L168 Benchmark]: RCFGBuilder took 236.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:30:38,460 INFO L168 Benchmark]: TraceAbstraction took 36723.33 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 717.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 774.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:30:38,461 INFO L168 Benchmark]: Witness Printer took 58.04 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:30:38,463 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.91 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.90 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36723.33 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 717.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 774.6 MB. Max. memory is 11.5 GB. * Witness Printer took 58.04 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 50]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L31] int x[60]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 60 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 60) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [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 [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<60 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<60 -1) [L46] x[60 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND FALSE !(i > 60/2) [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 60 [L18] COND TRUE i > 60/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 60) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNKNOWN Result, 36.6s OverallTime, 24 OverallIterations, 180 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 766 SDtfs, 1083 SDslu, 2339 SDs, 0 SdLazy, 1108 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 11462 GetRequests, 10862 SyntacticMatches, 114 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=572occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.8930923737103509 AbsIntWeakeningRatio, 1.1797752808988764 AbsIntAvgWeakeningVarsNumRemoved, 3.3895131086142323 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 12280 NumberOfCodeBlocks, 10985 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 11254 ConstructedInterpolants, 0 QuantifiedInterpolants, 6786724 SizeOfPredicates, 21 NumberOfNonLiveVariables, 10511 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 36 InterpolantComputations, 0 PerfectInterpolantSequences, 481413/505013 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...