./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum05_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_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:46:18,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:46:18,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:46:18,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:46:18,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:46:18,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:46:18,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:46:18,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:46:18,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:46:18,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:46:18,654 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:46:18,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:46:18,655 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:46:18,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:46:18,657 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:46:18,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:46:18,658 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:46:18,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:46:18,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:46:18,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:46:18,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:46:18,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:46:18,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:46:18,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:46:18,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:46:18,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:46:18,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:46:18,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:46:18,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:46:18,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:46:18,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:46:18,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:46:18,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:46:18,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:46:18,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:46:18,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:46:18,672 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:46:18,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:46:18,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:46:18,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:46:18,683 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:46:18,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:46:18,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:46:18,684 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:46:18,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:46:18,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:46:18,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:46:18,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:46:18,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:46:18,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:46:18,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:46:18,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:46:18,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:46:18,687 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:46:18,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:46:18,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:46:18,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:46:18,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer 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 -> Automizer 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 -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2018-11-23 15:46:18,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:46:18,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:46:18,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:46:18,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:46:18,727 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:46:18,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-23 15:46:18,777 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/data/fa6ecd1bb/3a00ca05ddc9404988625e78d0b2a4aa/FLAG2a8cb6264 [2018-11-23 15:46:19,119 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:46:19,119 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-23 15:46:19,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/data/fa6ecd1bb/3a00ca05ddc9404988625e78d0b2a4aa/FLAG2a8cb6264 [2018-11-23 15:46:19,536 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/data/fa6ecd1bb/3a00ca05ddc9404988625e78d0b2a4aa [2018-11-23 15:46:19,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:46:19,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:46:19,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:46:19,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:46:19,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:46:19,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21201346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19, skipping insertion in model container [2018-11-23 15:46:19,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:46:19,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:46:19,695 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:46:19,702 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:46:19,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:46:19,728 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:46:19,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19 WrapperNode [2018-11-23 15:46:19,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:46:19,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:46:19,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:46:19,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:46:19,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:46:19,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:46:19,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:46:19,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:46:19,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... [2018-11-23 15:46:19,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:46:19,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:46:19,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:46:19,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:46:19,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:46:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:46:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:46:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:46:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:46:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:46:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:46:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:46:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:46:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 15:46:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 15:46:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:46:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 15:46:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 15:46:20,038 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:46:20,039 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 15:46:20,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:20 BoogieIcfgContainer [2018-11-23 15:46:20,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:46:20,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:46:20,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:46:20,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:46:20,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:46:19" (1/3) ... [2018-11-23 15:46:20,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc20a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:46:20, skipping insertion in model container [2018-11-23 15:46:20,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:19" (2/3) ... [2018-11-23 15:46:20,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc20a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:46:20, skipping insertion in model container [2018-11-23 15:46:20,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:20" (3/3) ... [2018-11-23 15:46:20,045 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-11-23 15:46:20,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:46:20,059 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:46:20,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:46:20,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:46:20,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:46:20,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:46:20,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:46:20,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:46:20,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:46:20,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:46:20,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:46:20,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:46:20,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 15:46:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:46:20,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,116 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 15:46:20,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 15:46:20,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:46:20,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:46:20,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 15:46:20,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:46:20,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:46:20,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:46:20,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:46:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:46:20,307 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 15:46:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:20,322 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-23 15:46:20,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:46:20,323 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 15:46:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:20,329 INFO L225 Difference]: With dead ends: 64 [2018-11-23 15:46:20,329 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 15:46:20,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:46:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 15:46:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 15:46:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:46:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 15:46:20,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2018-11-23 15:46:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:20,358 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 15:46:20,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:46:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 15:46:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:46:20,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,361 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,361 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2018-11-23 15:46:20,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,373 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:20,373 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:20,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:20,455 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 15:46:20,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:46:20,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:46:20,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:46:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:46:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:46:20,474 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 15:46:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:20,484 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 15:46:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:46:20,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 15:46:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:20,485 INFO L225 Difference]: With dead ends: 56 [2018-11-23 15:46:20,485 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:46:20,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:46:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:46:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 15:46:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:46:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 15:46:20,490 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 15:46:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:20,490 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 15:46:20,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:46:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 15:46:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:46:20,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,491 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,491 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 15:46:20,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,505 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:20,505 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:20,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:20,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 15:46:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:46:20,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:46:20,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:46:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:46:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:46:20,579 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-23 15:46:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:20,593 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 15:46:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:46:20,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 15:46:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:20,597 INFO L225 Difference]: With dead ends: 57 [2018-11-23 15:46:20,597 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:46:20,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:46:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:46:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 15:46:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:46:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 15:46:20,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 39 [2018-11-23 15:46:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:20,606 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 15:46:20,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:46:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 15:46:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:46:20,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,608 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,608 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash -22870507, now seen corresponding path program 1 times [2018-11-23 15:46:20,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 15:46:20,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:46:20,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:46:20,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 15:46:20,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:20,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 15:46:20,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:46:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:46:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:20,726 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 15:46:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:20,744 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 15:46:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:46:20,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 15:46:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:20,745 INFO L225 Difference]: With dead ends: 62 [2018-11-23 15:46:20,745 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 15:46:20,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 15:46:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 15:46:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:46:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 15:46:20,750 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 39 [2018-11-23 15:46:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:20,750 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 15:46:20,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:46:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 15:46:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 15:46:20,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,751 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,751 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 15:46:20,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 15:46:20,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:46:20,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:20,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 15:46:20,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:20,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-23 15:46:20,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:46:20,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:46:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:20,882 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2018-11-23 15:46:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:20,912 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 15:46:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:46:20,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 15:46:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:20,913 INFO L225 Difference]: With dead ends: 68 [2018-11-23 15:46:20,913 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 15:46:20,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 15:46:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 15:46:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 15:46:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-23 15:46:20,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 48 [2018-11-23 15:46:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:20,919 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-23 15:46:20,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:46:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 15:46:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 15:46:20,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:20,921 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:20,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:20,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1681907214, now seen corresponding path program 1 times [2018-11-23 15:46:20,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:20,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:20,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:20,932 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:20,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:20,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 15:46:21,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 15:46:21,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:46:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:46:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,040 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2018-11-23 15:46:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,060 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 15:46:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:46:21,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 15:46:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,064 INFO L225 Difference]: With dead ends: 68 [2018-11-23 15:46:21,064 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 15:46:21,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 15:46:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 15:46:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 15:46:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 15:46:21,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 59 [2018-11-23 15:46:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,071 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 15:46:21,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:46:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 15:46:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:46:21,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,073 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,073 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 804630256, now seen corresponding path program 2 times [2018-11-23 15:46:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,087 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,088 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:21,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:46:21,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:46:21,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 15:46:21,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 15:46:21,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:46:21,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:46:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:21,218 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-23 15:46:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,245 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 15:46:21,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:46:21,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 15:46:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,248 INFO L225 Difference]: With dead ends: 70 [2018-11-23 15:46:21,248 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 15:46:21,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 15:46:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 15:46:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 15:46:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-23 15:46:21,252 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 61 [2018-11-23 15:46:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,253 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-23 15:46:21,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:46:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 15:46:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:46:21,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,254 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,258 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1929644946, now seen corresponding path program 3 times [2018-11-23 15:46:21,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,269 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,270 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:21,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:46:21,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 15:46:21,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 15:46:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 15:46:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:46:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:46:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:21,363 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-23 15:46:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,401 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2018-11-23 15:46:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:46:21,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 15:46:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,403 INFO L225 Difference]: With dead ends: 68 [2018-11-23 15:46:21,403 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 15:46:21,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 15:46:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 15:46:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 15:46:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 15:46:21,410 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2018-11-23 15:46:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,410 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 15:46:21,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:46:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 15:46:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 15:46:21,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,412 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,412 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -575638740, now seen corresponding path program 4 times [2018-11-23 15:46:21,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,423 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,424 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:21,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:46:21,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:46:21,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-23 15:46:21,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 15:46:21,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:46:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:46:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:46:21,510 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2018-11-23 15:46:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,531 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-11-23 15:46:21,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:46:21,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 15:46:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,534 INFO L225 Difference]: With dead ends: 78 [2018-11-23 15:46:21,534 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 15:46:21,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:46:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 15:46:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 15:46:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 15:46:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-23 15:46:21,539 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 72 [2018-11-23 15:46:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,539 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-23 15:46:21,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:46:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 15:46:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 15:46:21,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,540 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,540 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -336825618, now seen corresponding path program 5 times [2018-11-23 15:46:21,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,552 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,552 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:46:21,609 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 15:46:21,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 15:46:21,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 15:46:21,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:46:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:46:21,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,650 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-11-23 15:46:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,666 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-23 15:46:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:46:21,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-23 15:46:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,667 INFO L225 Difference]: With dead ends: 77 [2018-11-23 15:46:21,667 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 15:46:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 15:46:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 15:46:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 15:46:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 15:46:21,672 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 74 [2018-11-23 15:46:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,673 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 15:46:21,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:46:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 15:46:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 15:46:21,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,674 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,674 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1535873938, now seen corresponding path program 6 times [2018-11-23 15:46:21,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:21,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,684 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,685 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:46:21,754 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 15:46:21,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-23 15:46:21,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 15:46:21,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:46:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:46:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,798 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-11-23 15:46:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,811 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 15:46:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:46:21,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-23 15:46:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,812 INFO L225 Difference]: With dead ends: 76 [2018-11-23 15:46:21,812 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 15:46:21,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:46:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 15:46:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 15:46:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 15:46:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 15:46:21,817 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 83 [2018-11-23 15:46:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,818 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 15:46:21,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:46:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 15:46:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 15:46:21,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,819 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,819 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2064866548, now seen corresponding path program 7 times [2018-11-23 15:46:21,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,828 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,828 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:46:21,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 15:46:21,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:21,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 15:46:21,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:46:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:46:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:46:21,903 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-23 15:46:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:21,926 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-23 15:46:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:46:21,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 15:46:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:21,927 INFO L225 Difference]: With dead ends: 89 [2018-11-23 15:46:21,927 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 15:46:21,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:46:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 15:46:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 15:46:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 15:46:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-23 15:46:21,931 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 85 [2018-11-23 15:46:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:21,931 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-23 15:46:21,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:46:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 15:46:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 15:46:21,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:21,932 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:21,933 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:21,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash -998650230, now seen corresponding path program 8 times [2018-11-23 15:46:21,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:21,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:46:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:21,942 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:21,943 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:21,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:21,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:46:21,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:46:21,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:21,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 85 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-23 15:46:22,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:22,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 15:46:22,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:46:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:46:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:22,022 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-11-23 15:46:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:22,048 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-11-23 15:46:22,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:46:22,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 15:46:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:22,049 INFO L225 Difference]: With dead ends: 88 [2018-11-23 15:46:22,049 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 15:46:22,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 15:46:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 15:46:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 15:46:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-23 15:46:22,053 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 87 [2018-11-23 15:46:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-23 15:46:22,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:46:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 15:46:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 15:46:22,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:22,054 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:22,054 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:22,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1679580114, now seen corresponding path program 9 times [2018-11-23 15:46:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,064 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:22,064 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:22,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:46:22,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 15:46:22,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:22,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 15:46:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 15:46:22,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:46:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:46:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:22,453 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-11-23 15:46:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:22,463 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-23 15:46:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:46:22,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-23 15:46:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:22,465 INFO L225 Difference]: With dead ends: 86 [2018-11-23 15:46:22,465 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 15:46:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:46:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 15:46:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 15:46:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 15:46:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-23 15:46:22,470 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 96 [2018-11-23 15:46:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:22,470 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-23 15:46:22,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:46:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-23 15:46:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 15:46:22,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:22,471 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:22,471 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:22,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2078244212, now seen corresponding path program 10 times [2018-11-23 15:46:22,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:22,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:22,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,480 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:22,480 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:22,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:46:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:46:22,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:46:22,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:46:22,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:46:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 15:46:22,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:46:22,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 15:46:22,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:46:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:46:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:46:22,556 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2018-11-23 15:46:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:46:22,572 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-23 15:46:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:46:22,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-11-23 15:46:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:46:22,573 INFO L225 Difference]: With dead ends: 87 [2018-11-23 15:46:22,573 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 15:46:22,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:46:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 15:46:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 15:46:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 15:46:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-23 15:46:22,578 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 98 [2018-11-23 15:46:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:46:22,578 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-23 15:46:22,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:46:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-23 15:46:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 15:46:22,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:46:22,579 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:46:22,580 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:46:22,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:46:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614250, now seen corresponding path program 11 times [2018-11-23 15:46:22,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:46:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:46:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:46:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:46:22,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:46:22,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:46:22,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/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 15:46:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:46:23,089 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 15:46:23,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 15:46:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:46:23,329 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=9, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 5); VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #86#return; VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] RET #88#return; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] ----- [2018-11-23 15:46:23,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:46:23 BoogieIcfgContainer [2018-11-23 15:46:23,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:46:23,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:46:23,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:46:23,722 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:46:23,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:20" (3/4) ... [2018-11-23 15:46:23,724 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|=7, |#NULL.offset|=9, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=9] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; VAL [init_nondet_~i~0=0, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=1, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=2, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);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=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=3, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !!(~i~0 < 5);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; VAL [init_nondet_~i~0=4, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume !(~i~0 < 5); VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] assume true; VAL [init_nondet_~i~0=5, init_nondet_~x.base=10, init_nondet_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |init_nondet_#in~x.base|=10, |init_nondet_#in~x.offset|=0] [?] RET #82#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #84#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=(- 3), rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=0] [?] RET #86#return; VAL [main_~ret~1=0, main_~temp~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=0, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=1, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=2, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !!(~i~2 < 4);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; VAL [main_~i~2=3, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !(~i~2 < 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=0, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=1, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 > 2); VAL [rangesum_~cnt~0=0, rangesum_~i~1=2, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=0, rangesum_~i~1=3, rangesum_~ret~0=0, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=3, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !!(~i~1 < 5); VAL [rangesum_~cnt~0=1, rangesum_~i~1=4, rangesum_~ret~0=3, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume ~i~1 > 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=2, rangesum_~i~1=4, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume !(~i~1 < 5); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0] [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] assume true; VAL [rangesum_~cnt~0=2, rangesum_~i~1=5, rangesum_~ret~0=6, rangesum_~x.base=10, rangesum_~x.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |rangesum_#in~x.base|=10, |rangesum_#in~x.offset|=0, |rangesum_#res|=3] [?] RET #88#return; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] assume !false; VAL [main_~i~2=4, main_~ret2~0=0, main_~ret5~0=3, main_~ret~1=0, main_~temp~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#x~0.base|=10, |main_~#x~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=9, old(#NULL.base)=7, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=0, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=2, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=3, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6-L8] assume !!(~i~0 < 5); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=4, ~x.base=10, ~x.offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L6-L8] assume !(~i~0 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L4-L9] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~i~0=5, ~x.base=10, ~x.offset=0] [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, ~#x~0.base=10, ~#x~0.offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x.base=10, ~x.offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~#x~0.base=10, ~#x~0.offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !!(~i~2 < 4); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] assume !(~i~2 < 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume !(~i~1 > 2); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L17-L22] assume !!(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x.base=10, ~x.offset=0] [L18-L21] assume ~i~1 > 2; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L17-L22] assume !(~i~1 < 5); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L11-L27] ensures true; VAL [#in~x.base=10, #in~x.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x.base=10, ~x.offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#x~0.base=10, ~#x~0.offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=9, old(#NULL!base)=7, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call ~#x~0 := #Ultimate.alloc(20); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L32] CALL call init_nondet(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=0, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=2, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=3, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6-L8] COND FALSE !(!(~i~0 < 5)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=4, ~x!base=10, ~x!offset=0] [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L6-L8] COND TRUE !(~i~0 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~i~0=5, ~x!base=10, ~x!offset=0] [L32] RET call init_nondet(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] CALL call #t~ret4 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L38] RET call #t~ret4 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, ~#x~0!base=10, ~#x~0!offset=0] [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] CALL call #t~ret7 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=-3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~cnt~0=2, ~i~1=5, ~ret~0=0, ~x!base=10, ~x!offset=0] [L41] RET call #t~ret7 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~#x~0!base=10, ~#x~0!offset=0, ~ret~1=0, ~temp~0=-2147483648] [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=0, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=1, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=2, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND FALSE !(!(~i~2 < 4)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=3, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L43-L45] COND TRUE !(~i~2 < 4) VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 16 + ~#x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] CALL call #t~ret11 := rangesum(~#x~0); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=0, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=1, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND FALSE !(~i~1 > 2) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=2, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=0, ~i~1=3, ~ret~0=0, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=3, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L17-L22] COND FALSE !(!(~i~1 < 5)) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=1, ~i~1=4, ~ret~0=3, ~x!base=10, ~x!offset=0] [L18] COND TRUE ~i~1 > 2 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=4, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L17-L22] COND TRUE !(~i~1 < 5) VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); VAL [#in~x!base=10, #in~x!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~cnt~0=2, ~i~1=5, ~ret~0=6, ~x!base=10, ~x!offset=0] [L47] RET call #t~ret11 := rangesum(~#x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret~1=0, ~temp~0=3] [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L50] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#x~0!base=10, ~#x~0!offset=0, ~i~2=4, ~ret2~0=0, ~ret5~0=3, ~ret~1=0, ~temp~0=3] [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] ----- [2018-11-23 15:46:24,729 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ac22b522-2bff-4a2f-bf1d-26a19cf503a2/bin-2019/uautomizer/witness.graphml [2018-11-23 15:46:24,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:46:24,730 INFO L168 Benchmark]: Toolchain (without parser) took 5190.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 959.3 MB in the beginning and 912.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 188.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,732 INFO L168 Benchmark]: CDTParser took 0.16 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 15:46:24,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:46:24,733 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,733 INFO L168 Benchmark]: RCFGBuilder took 273.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,733 INFO L168 Benchmark]: TraceAbstraction took 3681.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 190.5 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,733 INFO L168 Benchmark]: Witness Printer took 1008.14 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 912.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:46:24,735 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.16 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 188.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 273.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3681.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 190.5 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. * Witness Printer took 1008.14 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 912.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[5]; VAL [x={10:0}] [L32] CALL init_nondet(x) VAL [x={10:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={10:0}, x={10:0}] [L6] COND TRUE i < 5 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={10:0}, x={10:0}] [L6] COND FALSE !(i < 5) VAL [i=5, x={10:0}, x={10:0}] [L32] RET init_nondet(x) VAL [x={10:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={10:0}] [L38] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=0, x={10:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=0, temp=-2147483648, x={10:0}] [L41] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=-3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=-3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=0, cnt=2, i=5, ret=0, x={10:0}, x={10:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=0, ret=0, temp=-2147483648, x={10:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND TRUE i<5 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L46] x[5 -1] = temp VAL [i=4, ret=0, ret2=0, temp=3, x={10:0}] [L47] CALL, EXPR rangesum(x) VAL [x={10:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=3, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=3, x={10:0}, x={10:0}] [L18] COND TRUE i > 5/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=6, x={10:0}, x={10:0}] [L17] i++ VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=3, cnt=2, i=5, ret=6, x={10:0}, x={10:0}] [L47] RET, EXPR rangesum(x) VAL [i=4, rangesum(x)=3, ret=0, ret2=0, temp=3, x={10:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] [L50] __VERIFIER_error() VAL [i=4, ret=0, ret2=0, ret5=3, temp=3, x={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 16 OverallIterations, 15 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 539 SDtfs, 50 SDslu, 822 SDs, 0 SdLazy, 158 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1048 ConstructedInterpolants, 0 QuantifiedInterpolants, 81768 SizeOfPredicates, 13 NumberOfNonLiveVariables, 2648 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2275/2350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...