./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.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_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/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 279fae57395782089eff32ec1396d1726d808c7f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:53:04,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:53:04,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:53:04,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:53:04,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:53:04,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:53:04,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:53:04,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:53:04,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:53:04,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:53:04,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:53:04,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:53:04,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:53:04,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:53:04,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:53:04,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:53:04,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:53:04,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:53:04,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:53:04,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:53:04,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:53:04,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:53:04,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:53:04,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:53:04,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:53:04,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:53:04,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:53:04,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:53:04,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:53:04,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:53:04,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:53:04,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:53:04,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:53:04,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:53:04,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:53:04,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:53:04,895 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:53:04,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:53:04,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:53:04,902 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:53:04,903 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:53:04,903 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:53:04,904 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:53:04,904 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:53:04,904 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:53:04,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:53:04,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:53:04,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:53:04,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:53:04,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:53:04,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:53:04,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:53:04,907 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_7b470dff-2caf-4e40-878e-f283c574a9cd/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 -> 279fae57395782089eff32ec1396d1726d808c7f [2018-11-23 00:53:04,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:53:04,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:53:04,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:53:04,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:53:04,943 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:53:04,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 00:53:04,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/data/1a5d20f05/a77b93566f33449482c96c8a2022339d/FLAG7445e7ccd [2018-11-23 00:53:05,291 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:53:05,292 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/sv-benchmarks/c/reducercommutativity/rangesum_false-unreach-call_true-termination.i [2018-11-23 00:53:05,295 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/data/1a5d20f05/a77b93566f33449482c96c8a2022339d/FLAG7445e7ccd [2018-11-23 00:53:05,304 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/data/1a5d20f05/a77b93566f33449482c96c8a2022339d [2018-11-23 00:53:05,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:53:05,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:53:05,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:53:05,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:53:05,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:53:05,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462bb081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05, skipping insertion in model container [2018-11-23 00:53:05,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:53:05,338 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:53:05,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:53:05,461 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:53:05,474 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:53:05,484 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:53:05,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05 WrapperNode [2018-11-23 00:53:05,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:53:05,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:53:05,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:53:05,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:53:05,489 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:53:05" (1/1) ... [2018-11-23 00:53:05,496 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:53:05" (1/1) ... [2018-11-23 00:53:05,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:53:05,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:53:05,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:53:05,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:53:05,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... [2018-11-23 00:53:05,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:53:05,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:53:05,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:53:05,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:53:05,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/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:53:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:53:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:53:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:53:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:53:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:53:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:53:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:53:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:53:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:53:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 00:53:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 00:53:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:53:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 00:53:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 00:53:05,769 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:53:05,769 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 00:53:05,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:05 BoogieIcfgContainer [2018-11-23 00:53:05,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:53:05,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:53:05,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:53:05,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:53:05,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:05" (1/3) ... [2018-11-23 00:53:05,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c084725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:05, skipping insertion in model container [2018-11-23 00:53:05,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:05" (2/3) ... [2018-11-23 00:53:05,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c084725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:05, skipping insertion in model container [2018-11-23 00:53:05,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:05" (3/3) ... [2018-11-23 00:53:05,775 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum_false-unreach-call_true-termination.i [2018-11-23 00:53:05,782 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:53:05,790 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:53:05,804 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:53:05,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:53:05,828 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:53:05,828 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:53:05,828 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:53:05,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:53:05,829 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:53:05,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:53:05,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:53:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 00:53:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:53:05,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:05,844 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] [2018-11-23 00:53:05,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2018-11-23 00:53:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:05,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:05,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:05,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:05,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:05,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 00:53:05,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:05,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:53:05,952 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-23 00:53:05,954 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [28], [30], [33], [34], [45], [51], [66], [68], [69], [81], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:05,979 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:05,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:06,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:53:06,061 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 26 variables. [2018-11-23 00:53:06,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:06,074 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:53:06,121 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 92.26% of their original sizes. [2018-11-23 00:53:06,122 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:53:06,140 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-23 00:53:06,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:53:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:53:06,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:53:06,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:53:06,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:53:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:53:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:53:06,152 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-11-23 00:53:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:06,232 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2018-11-23 00:53:06,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:53:06,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 00:53:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:06,238 INFO L225 Difference]: With dead ends: 67 [2018-11-23 00:53:06,239 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 00:53:06,241 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:53:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 00:53:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 00:53:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 00:53:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 00:53:06,268 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2018-11-23 00:53:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:06,268 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 00:53:06,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:53:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 00:53:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:53:06,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:06,270 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] [2018-11-23 00:53:06,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:06,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:06,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2018-11-23 00:53:06,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:06,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:06,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:06,282 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:06,282 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:06,282 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/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:53:06,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:06,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:06,336 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-23 00:53:06,337 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [28], [30], [33], [34], [45], [51], [66], [68], [69], [75], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:06,339 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:06,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:06,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 00:53:06,445 INFO L272 AbstractInterpreter]: Visited 17 different actions 17 times. Never merged. Never widened. Performed 107 root evaluator evaluations with a maximum evaluation depth of 11. Performed 107 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Never found a fixpoint. Largest state had 26 variables. [2018-11-23 00:53:06,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:06,446 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 00:53:06,519 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 86.07% of their original sizes. [2018-11-23 00:53:06,520 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 00:53:06,578 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-23 00:53:06,579 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 00:53:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:53:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 00:53:06,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:53:06,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:53:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:53:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:53:06,581 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 8 states. [2018-11-23 00:53:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:06,903 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2018-11-23 00:53:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:53:06,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 00:53:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:06,906 INFO L225 Difference]: With dead ends: 67 [2018-11-23 00:53:06,906 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 00:53:06,907 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:53:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 00:53:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2018-11-23 00:53:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 00:53:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 00:53:06,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2018-11-23 00:53:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:06,916 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 00:53:06,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:53:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 00:53:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:53:06,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:06,918 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] [2018-11-23 00:53:06,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:06,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2018-11-23 00:53:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:06,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 00:53:07,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:53:07,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 00:53:07,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:53:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:53:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:53:07,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:53:07,057 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 9 states. [2018-11-23 00:53:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:07,174 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2018-11-23 00:53:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:53:07,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-11-23 00:53:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:07,176 INFO L225 Difference]: With dead ends: 63 [2018-11-23 00:53:07,176 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 00:53:07,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:53:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 00:53:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2018-11-23 00:53:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 00:53:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-11-23 00:53:07,186 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 38 [2018-11-23 00:53:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:07,186 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 00:53:07,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:53:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-11-23 00:53:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 00:53:07,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:07,188 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 00:53:07,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:07,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 699235283, now seen corresponding path program 1 times [2018-11-23 00:53:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:07,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:07,203 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:07,204 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:07,204 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/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:53:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:07,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:07,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-23 00:53:07,250 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [28], [30], [33], [34], [45], [51], [53], [56], [60], [66], [67], [68], [69], [75], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:07,251 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:07,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:08,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:53:08,369 INFO L272 AbstractInterpreter]: Visited 34 different actions 292 times. Merged at 17 different actions 168 times. Widened at 1 different actions 7 times. Performed 1432 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1432 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 44 fixpoints after 6 different actions. Largest state had 26 variables. [2018-11-23 00:53:08,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:08,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:53:08,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:08,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/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:53:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:08,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:53:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:08,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 00:53:08,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 00:53:08,512 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:53:08,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2018-11-23 00:53:08,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:53:08,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:53:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:53:08,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:53:08,514 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 4 states. [2018-11-23 00:53:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:08,559 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2018-11-23 00:53:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:53:08,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 00:53:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:08,560 INFO L225 Difference]: With dead ends: 83 [2018-11-23 00:53:08,560 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:53:08,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:53:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:53:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 00:53:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:53:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-23 00:53:08,568 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 41 [2018-11-23 00:53:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:08,568 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 00:53:08,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:53:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-11-23 00:53:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 00:53:08,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:08,569 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 00:53:08,571 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:08,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1178839093, now seen corresponding path program 1 times [2018-11-23 00:53:08,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:08,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:08,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:08,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:08,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:08,583 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:08,583 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:08,584 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:08,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:08,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:08,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-23 00:53:08,636 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [28], [30], [33], [34], [45], [51], [53], [56], [60], [66], [67], [68], [69], [75], [77], [79], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:08,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:08,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:09,447 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:53:09,448 INFO L272 AbstractInterpreter]: Visited 36 different actions 293 times. Merged at 21 different actions 168 times. Widened at 2 different actions 6 times. Performed 1441 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1441 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 44 fixpoints after 8 different actions. Largest state had 26 variables. [2018-11-23 00:53:09,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:09,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:53:09,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:09,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:09,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:53:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 00:53:09,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 00:53:09,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:53:09,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 00:53:09,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:53:09,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:53:09,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:53:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:53:09,640 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 8 states. [2018-11-23 00:53:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:09,782 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2018-11-23 00:53:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:53:09,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-23 00:53:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:09,784 INFO L225 Difference]: With dead ends: 85 [2018-11-23 00:53:09,784 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 00:53:09,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:53:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 00:53:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 00:53:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:53:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 00:53:09,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 43 [2018-11-23 00:53:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:09,793 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 00:53:09,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:53:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 00:53:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 00:53:09,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:09,795 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:53:09,795 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:09,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1778367465, now seen corresponding path program 2 times [2018-11-23 00:53:09,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:09,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:09,808 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:09,808 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:09,808 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:09,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:53:09,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:09,864 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:53:09,864 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:53:09,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:09,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:53:09,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:53:09,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 00:53:09,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:53:09,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 00:53:09,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 00:53:10,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:53:10,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 00:53:10,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:53:10,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 00:53:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:53:10,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:53:10,026 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-11-23 00:53:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:10,082 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2018-11-23 00:53:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:53:10,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-23 00:53:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:10,084 INFO L225 Difference]: With dead ends: 86 [2018-11-23 00:53:10,084 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 00:53:10,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:53:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 00:53:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 00:53:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 00:53:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-11-23 00:53:10,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 45 [2018-11-23 00:53:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:10,091 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-11-23 00:53:10,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 00:53:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-23 00:53:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 00:53:10,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:10,092 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:53:10,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:10,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1346922871, now seen corresponding path program 1 times [2018-11-23 00:53:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:10,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:53:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:10,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:10,110 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:10,110 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:10,110 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:10,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:10,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:10,153 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 00:53:10,153 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [28], [30], [33], [34], [45], [51], [53], [56], [58], [60], [66], [67], [68], [69], [75], [77], [79], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:10,155 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:10,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:10,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:53:10,830 INFO L272 AbstractInterpreter]: Visited 37 different actions 337 times. Merged at 22 different actions 182 times. Widened at 2 different actions 7 times. Performed 1602 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 74 fixpoints after 11 different actions. Largest state had 26 variables. [2018-11-23 00:53:10,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:10,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:53:10,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:10,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:10,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:53:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:10,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 00:53:10,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-23 00:53:10,939 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:53:10,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-11-23 00:53:10,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:53:10,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:53:10,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:53:10,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:53:10,940 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 4 states. [2018-11-23 00:53:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:10,978 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-23 00:53:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:53:10,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-23 00:53:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:10,979 INFO L225 Difference]: With dead ends: 84 [2018-11-23 00:53:10,979 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 00:53:10,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:53:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 00:53:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 00:53:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 00:53:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 00:53:10,987 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 63 [2018-11-23 00:53:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:10,987 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 00:53:10,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:53:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 00:53:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 00:53:10,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:10,988 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:53:10,988 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:10,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2018-11-23 00:53:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:10,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:10,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:10,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:10,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:11,004 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:11,004 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:11,004 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:11,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:11,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:11,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 00:53:11,050 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [22], [24], [28], [30], [33], [34], [45], [51], [53], [56], [58], [60], [66], [67], [68], [69], [75], [77], [79], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:11,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:11,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:11,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:53:11,745 INFO L272 AbstractInterpreter]: Visited 39 different actions 394 times. Merged at 24 different actions 214 times. Widened at 3 different actions 9 times. Performed 1898 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 89 fixpoints after 13 different actions. Largest state had 28 variables. [2018-11-23 00:53:11,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:11,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:53:11,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:11,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:11,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:11,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:53:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:11,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 00:53:11,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 00:53:11,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:53:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-11-23 00:53:11,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:53:11,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:53:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:53:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:53:11,913 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 13 states. [2018-11-23 00:53:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:12,023 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-11-23 00:53:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:53:12,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 00:53:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:12,025 INFO L225 Difference]: With dead ends: 139 [2018-11-23 00:53:12,025 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 00:53:12,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:53:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 00:53:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 00:53:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 00:53:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2018-11-23 00:53:12,032 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 65 [2018-11-23 00:53:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:12,033 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2018-11-23 00:53:12,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:53:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2018-11-23 00:53:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 00:53:12,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:12,036 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 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] [2018-11-23 00:53:12,036 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:12,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2018-11-23 00:53:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:12,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:12,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:12,048 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:12,048 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:12,049 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:12,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:53:12,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:12,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 00:53:12,099 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:53:12,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:12,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:53:12,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 00:53:12,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 00:53:12,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:53:12,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 00:53:12,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 00:53:12,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:53:12,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-11-23 00:53:12,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:53:12,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 00:53:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:53:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:53:12,297 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 10 states. [2018-11-23 00:53:12,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:12,475 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2018-11-23 00:53:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:53:12,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-11-23 00:53:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:12,476 INFO L225 Difference]: With dead ends: 149 [2018-11-23 00:53:12,477 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 00:53:12,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:53:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 00:53:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2018-11-23 00:53:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 00:53:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-23 00:53:12,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 67 [2018-11-23 00:53:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:12,483 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-23 00:53:12,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 00:53:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-23 00:53:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 00:53:12,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:12,484 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:53:12,484 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:12,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2018-11-23 00:53:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:12,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:53:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:12,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:12,494 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:12,494 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:12,494 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:12,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:12,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:12,534 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-23 00:53:12,534 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [10], [12], [14], [20], [22], [24], [28], [30], [33], [34], [45], [51], [53], [56], [58], [60], [66], [68], [69], [75], [77], [79], [83], [84], [85], [86], [88], [89], [90], [91], [92], [93], [94], [95] [2018-11-23 00:53:12,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:53:12,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:53:12,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:53:12,998 INFO L272 AbstractInterpreter]: Visited 38 different actions 267 times. Merged at 23 different actions 138 times. Widened at 3 different actions 6 times. Performed 1294 root evaluator evaluations with a maximum evaluation depth of 11. Performed 1294 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 48 fixpoints after 9 different actions. Largest state had 28 variables. [2018-11-23 00:53:13,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:13,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:53:13,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:53:13,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:53:13,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:13,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:53:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:13,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-23 00:53:13,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:53:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 00:53:13,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:53:13,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 00:53:13,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:53:13,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 00:53:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:53:13,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:53:13,119 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 10 states. [2018-11-23 00:53:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:53:13,164 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-11-23 00:53:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:53:13,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-23 00:53:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:53:13,165 INFO L225 Difference]: With dead ends: 86 [2018-11-23 00:53:13,165 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 00:53:13,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:53:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 00:53:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 00:53:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 00:53:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-23 00:53:13,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 73 [2018-11-23 00:53:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:53:13,172 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-23 00:53:13,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 00:53:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-23 00:53:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 00:53:13,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:53:13,172 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:53:13,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:53:13,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:53:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2018-11-23 00:53:13,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:53:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:53:13,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:53:13,180 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 00:53:13,180 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 00:53:13,180 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 00:53:13,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:53:13,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 00:53:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:53:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:53:13,295 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=6, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~0 < ~N~0); VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume true; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] RET #89#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=(- 1), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 1), main_~temp~0=2147481534, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] RET #93#return; VAL [main_~ret~1=(- 1), main_~temp~0=2147481534, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=(- 1), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=0, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=1, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=1, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~2 < ~N~0 - 1); VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] RET #95#return; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !false; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-1, temp=2147481534, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, ret=-1, temp=2147481534, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-1, ret2=-1, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-1, ret2=-1, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] ----- [2018-11-23 00:53:13,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:13 BoogieIcfgContainer [2018-11-23 00:53:13,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:53:13,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:53:13,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:53:13,512 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:53:13,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:05" (3/4) ... [2018-11-23 00:53:13,521 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=5, |#NULL.offset|=6, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=5, |old(#NULL.offset)|=6, |old(~N~0)|=7, ~N~0=0] [?] RET #85#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~N~0 := #t~nondet4;havoc #t~nondet4; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~N~0 > 1;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=0, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=1, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~0 < ~N~0);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=2, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~0 < ~N~0); VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume true; VAL [init_nondet_~i~0=3, init_nondet_~x.base=9, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=9, |init_nondet_#in~x.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] RET #89#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=(- 1), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=(- 1), main_~temp~0=2147481534, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=(- 1), rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=(- 1), ~N~0=3] [?] RET #93#return; VAL [main_~ret~1=(- 1), main_~temp~0=2147481534, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=(- 1), |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=0, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=1, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !!(~i~2 < ~N~0 - 1);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; VAL [main_~i~2=1, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !(~i~2 < ~N~0 - 1); VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !!(~i~1 < ~N~0); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; VAL [rangesum_~cnt~0=1, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume !(~i~1 < ~N~0); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, ~N~0=3] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] assume true; VAL [rangesum_~cnt~0=1, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=9, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~N~0)|=0, |rangesum_#in~x.base|=9, |rangesum_#in~x.offset|=0, |rangesum_#res|=0, ~N~0=3] [?] RET #95#return; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] assume !false; VAL [main_~i~2=2, main_~ret2~0=(- 1), main_~ret5~0=0, main_~ret~1=(- 1), main_~temp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=9, |main_~#x~0.offset|=0, |old(~N~0)|=0, ~N~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5, #NULL.offset=6, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~N~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=5, old(#NULL.offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L33-L55] assume ~N~0 > 1; [L34] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4 * ~N~0); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !!(~i~0 < ~N~0); [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L8] havoc #t~nondet1; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x.base=9, ~x.offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L7-L9] assume !(~i~0 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L5-L10] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x.base=9, ~x.offset=0] [L35] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L43] call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4); [L43] havoc #t~mem7; [L43] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x.base=9, ~x.offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !!(~i~2 < ~N~0 - 1); [L47] call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L47] call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L47] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] assume !(~i~2 < ~N~0 - 1); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4 * (~N~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !!(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L19-L22] assume ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2); [L20] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L18-L23] assume !(~i~1 < ~N~0); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L24-L27] assume 0 != ~cnt~0; [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L12-L28] ensures true; VAL [#in~x.base=9, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x.base=9, ~x.offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52-L54] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~N~0)=0, ~#x~0.base=9, ~#x~0.offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5, #NULL!offset=6, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=7] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~N~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=5, old(#NULL!offset)=6, old(~N~0)=7, ~N~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~N~0=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=0] [L32] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L32] ~N~0 := #t~nondet4; [L32] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L33] COND TRUE ~N~0 > 1 [L34] FCALL call ~#x~0 := #Ultimate.alloc(4 * ~N~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L35] CALL call init_nondet(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L5-L10] ~x := #in~x; [L6] havoc ~i~0; [L7] ~i~0 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=0, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=1, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND FALSE !(!(~i~0 < ~N~0)) [L8] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L8] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L8] havoc #t~nondet1; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=2, ~N~0=3, ~x!base=9, ~x!offset=0] [L7] #t~post0 := ~i~0; [L7] ~i~0 := 1 + #t~post0; [L7] havoc #t~post0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L7-L9] COND TRUE !(~i~0 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~i~0=3, ~N~0=3, ~x!base=9, ~x!offset=0] [L35] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L36] havoc ~temp~0; [L37] havoc ~ret~1; [L38] havoc ~ret2~0; [L39] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] CALL call #t~ret5 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L41] RET call #t~ret5 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3] [L41] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L41] ~ret~1 := #t~ret5; [L41] havoc #t~ret5; [L43] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] ~temp~0 := #t~mem6; [L43] havoc #t~mem6; [L43] FCALL call #t~mem7 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L43] FCALL call write~int(#t~mem7, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L43] havoc #t~mem7; [L43] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] CALL call #t~ret8 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=-1, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=-1, ~x!base=9, ~x!offset=0] [L44] RET call #t~ret8 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=-1, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~N~0=3, ~ret~1=-1, ~temp~0=2147481534] [L44] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L44] ~ret2~0 := #t~ret8; [L44] havoc #t~ret8; [L45] FCALL call #t~mem9 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L45] ~temp~0 := #t~mem9; [L45] havoc #t~mem9; [L46] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=0, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND FALSE !(!(~i~2 < ~N~0 - 1)) [L47] FCALL call #t~mem11 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L47] FCALL call write~int(#t~mem11, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L47] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=1, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46] #t~post10 := ~i~2; [L46] ~i~2 := 1 + #t~post10; [L46] havoc #t~post10; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L46-L48] COND TRUE !(~i~2 < ~N~0 - 1) VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L49] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * (~N~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] CALL call #t~ret12 := rangesum(~#x~0); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~N~0=3] [L12-L28] ~x := #in~x; [L14] havoc ~i~1; [L15] havoc ~ret~0; [L16] ~ret~0 := 0; [L17] ~cnt~0 := 0; [L18] ~i~1 := 0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=0, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND FALSE !(~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=1, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND FALSE !(!(~i~1 < ~N~0)) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=0, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L19] COND TRUE ~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2) [L20] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L20] ~ret~0 := ~ret~0 + #t~mem3; [L20] havoc #t~mem3; [L21] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=2, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18] #t~post2 := ~i~1; [L18] ~i~1 := 1 + #t~post2; [L18] havoc #t~post2; VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L18-L23] COND TRUE !(~i~1 < ~N~0) VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L24] COND TRUE 0 != ~cnt~0 [L25] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=9, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, old(~N~0)=0, ~cnt~0=1, ~i~1=3, ~N~0=3, ~ret~0=0, ~x!base=9, ~x!offset=0] [L50] RET call #t~ret12 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret~1=-1, ~temp~0=0] [L50] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; [L50] ~ret5~0 := #t~ret12; [L50] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L52] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L53] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~N~0)=0, ~#x~0!base=9, ~#x~0!offset=0, ~i~2=2, ~N~0=3, ~ret2~0=-1, ~ret5~0=0, ~ret~1=-1, ~temp~0=0] [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-1, temp=2147481534, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, ret=-1, temp=2147481534, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-1, ret2=-1, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-1, ret2=-1, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] ----- [2018-11-23 00:53:14,076 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b470dff-2caf-4e40-878e-f283c574a9cd/bin-2019/utaipan/witness.graphml [2018-11-23 00:53:14,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:53:14,077 INFO L168 Benchmark]: Toolchain (without parser) took 8769.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.7 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 321.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,077 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:53:14,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.42 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:53:14,078 INFO L168 Benchmark]: Boogie Preprocessor took 54.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,078 INFO L168 Benchmark]: RCFGBuilder took 213.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,079 INFO L168 Benchmark]: TraceAbstraction took 7741.91 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.2 MB). Peak memory consumption was 330.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,079 INFO L168 Benchmark]: Witness Printer took 563.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:53:14,081 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.75 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.42 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 213.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7741.91 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.2 MB). Peak memory consumption was 330.7 MB. Max. memory is 11.5 GB. * Witness Printer took 563.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [\old(N)=7, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={9:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={9:0}, x={9:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={9:0}, x={9:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={9:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={9:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, x={9:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=-1, temp=2147481534, x={9:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={9:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=-1, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=-1, cnt=1, i=3, N=3, ret=-1, x={9:0}, x={9:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=-1, ret=-1, temp=2147481534, x={9:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=-1, ret2=-1, temp=0, x={9:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={9:0}, x={9:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={9:0}, x={9:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=-1, ret2=-1, temp=0, x={9:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=-1, ret2=-1, ret5=0, temp=0, x={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. UNSAFE Result, 7.6s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 342 SDslu, 729 SDs, 0 SdLazy, 622 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 891 GetRequests, 792 SyntacticMatches, 21 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 7 AbstIntIterations, 2 AbstIntStrong, 0.9393763893763891 AbsIntWeakeningRatio, 1.3783783783783783 AbsIntAvgWeakeningVarsNumRemoved, 1.5 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 983 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 107525 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1046/1085 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...