./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02e722fa6530375aea2bbc43a68e422ad66c6f3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:58:06,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:58:06,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:58:06,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:58:06,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:58:06,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:58:06,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:58:06,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:58:06,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:58:06,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:58:06,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:58:06,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:58:06,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:58:06,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:58:06,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:58:06,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:58:06,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:58:06,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:58:06,784 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:58:06,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:58:06,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:58:06,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:58:06,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:58:06,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:58:06,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:58:06,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:58:06,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:58:06,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:58:06,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:58:06,791 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:58:06,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:58:06,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:58:06,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:58:06,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:58:06,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:58:06,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:58:06,792 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:58:06,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:58:06,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:58:06,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:58:06,803 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:58:06,803 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:58:06,803 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:58:06,803 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:58:06,804 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:58:06,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:58:06,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:58:06,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:58:06,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:58:06,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:58:06,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:58:06,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:58:06,808 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02e722fa6530375aea2bbc43a68e422ad66c6f3 [2018-11-23 06:58:06,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:58:06,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:58:06,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:58:06,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:58:06,844 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:58:06,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/../../sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-11-23 06:58:06,891 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/data/124631df9/e4dcee9f573b4d64b4917a80ec944283/FLAG9872816e7 [2018-11-23 06:58:07,199 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:58:07,199 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/sv-benchmarks/c/reducercommutativity/rangesum20_false-unreach-call.i [2018-11-23 06:58:07,204 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/data/124631df9/e4dcee9f573b4d64b4917a80ec944283/FLAG9872816e7 [2018-11-23 06:58:07,213 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/data/124631df9/e4dcee9f573b4d64b4917a80ec944283 [2018-11-23 06:58:07,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:58:07,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:58:07,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:58:07,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:58:07,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:58:07,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c2df8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07, skipping insertion in model container [2018-11-23 06:58:07,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:58:07,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:58:07,352 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:58:07,358 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:58:07,371 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:58:07,379 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:58:07,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07 WrapperNode [2018-11-23 06:58:07,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:58:07,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:58:07,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:58:07,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:58:07,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:58:07,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:58:07,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:58:07,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:58:07,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... [2018-11-23 06:58:07,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:58:07,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:58:07,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:58:07,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:58:07,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:58:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:58:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:58:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:58:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:58:07,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:58:07,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:58:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:58:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:58:07,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:58:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-23 06:58:07,483 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-23 06:58:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:58:07,483 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-23 06:58:07,483 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-23 06:58:07,657 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:58:07,657 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 06:58:07,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:58:07 BoogieIcfgContainer [2018-11-23 06:58:07,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:58:07,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:58:07,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:58:07,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:58:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:58:07" (1/3) ... [2018-11-23 06:58:07,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428aed90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:58:07, skipping insertion in model container [2018-11-23 06:58:07,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:58:07" (2/3) ... [2018-11-23 06:58:07,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428aed90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:58:07, skipping insertion in model container [2018-11-23 06:58:07,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:58:07" (3/3) ... [2018-11-23 06:58:07,662 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20_false-unreach-call.i [2018-11-23 06:58:07,669 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:58:07,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:58:07,686 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:58:07,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:58:07,712 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:58:07,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:58:07,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:58:07,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:58:07,713 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:58:07,713 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:58:07,713 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:58:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 06:58:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 06:58:07,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:07,727 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 06:58:07,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:07,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2018-11-23 06:58:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:07,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:07,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:07,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:58:07,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:07,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:07,826 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-23 06:58:07,827 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [55], [59], [61], [62], [68], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:07,851 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:07,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:07,932 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:07,933 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 06:58:07,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:07,948 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:07,987 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 88.89% of their original sizes. [2018-11-23 06:58:07,987 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:08,006 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-11-23 06:58:08,006 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:08,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:58:08,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:58:08,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:08,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:58:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:58:08,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:58:08,017 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-11-23 06:58:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:08,156 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-23 06:58:08,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:58:08,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 06:58:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:08,165 INFO L225 Difference]: With dead ends: 66 [2018-11-23 06:58:08,165 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 06:58:08,167 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 06:58:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 06:58:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 06:58:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 06:58:08,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2018-11-23 06:58:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:08,199 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 06:58:08,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:58:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 06:58:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:58:08,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:08,200 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 06:58:08,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:08,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2018-11-23 06:58:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:08,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:08,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:08,213 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:08,213 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:08,213 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:08,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:08,258 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 06:58:08,258 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:08,259 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:08,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:08,301 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:08,302 INFO L272 AbstractInterpreter]: Visited 17 different actions 26 times. Merged at 2 different actions 6 times. Never widened. Performed 151 root evaluator evaluations with a maximum evaluation depth of 3. Performed 151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-11-23 06:58:08,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:08,310 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:08,335 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 85.4% of their original sizes. [2018-11-23 06:58:08,335 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:08,362 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-23 06:58:08,362 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:08,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:58:08,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:58:08,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:08,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:58:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:58:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:58:08,364 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 7 states. [2018-11-23 06:58:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:08,611 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 06:58:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:58:08,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-23 06:58:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:08,612 INFO L225 Difference]: With dead ends: 54 [2018-11-23 06:58:08,612 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 06:58:08,613 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:58:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 06:58:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 06:58:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 06:58:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 06:58:08,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2018-11-23 06:58:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:08,619 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 06:58:08,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:58:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 06:58:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 06:58:08,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:08,620 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 06:58:08,621 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:08,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1719401286, now seen corresponding path program 1 times [2018-11-23 06:58:08,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:08,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:08,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:08,632 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:08,632 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:08,632 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:08,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:08,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:08,676 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 06:58:08,676 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:08,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:08,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:08,842 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:08,842 INFO L272 AbstractInterpreter]: Visited 21 different actions 47 times. Merged at 6 different actions 19 times. Widened at 1 different actions 1 times. Performed 219 root evaluator evaluations with a maximum evaluation depth of 10. Performed 219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 06:58:08,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:08,854 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:08,908 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 84.74% of their original sizes. [2018-11-23 06:58:08,909 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:08,945 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 06:58:08,945 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:08,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:58:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:58:08,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:08,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:58:08,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:58:08,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:58:08,947 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 7 states. [2018-11-23 06:58:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:09,121 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-11-23 06:58:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:58:09,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 06:58:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:09,123 INFO L225 Difference]: With dead ends: 61 [2018-11-23 06:58:09,123 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 06:58:09,124 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:58:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 06:58:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 06:58:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 06:58:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 06:58:09,131 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 48 [2018-11-23 06:58:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:09,131 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 06:58:09,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:58:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 06:58:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 06:58:09,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:09,132 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 06:58:09,132 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:09,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2018-11-23 06:58:09,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:09,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:09,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:09,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:09,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:09,195 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 06:58:09,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:09,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:09,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 06:58:09,196 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:09,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:09,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:09,230 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:09,230 INFO L272 AbstractInterpreter]: Visited 28 different actions 68 times. Merged at 5 different actions 24 times. Never widened. Performed 295 root evaluator evaluations with a maximum evaluation depth of 3. Performed 295 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 06:58:09,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:09,238 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:09,263 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 83.4% of their original sizes. [2018-11-23 06:58:09,263 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:09,338 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 06:58:09,338 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:09,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:58:09,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-23 06:58:09,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:09,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:58:09,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:58:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:09,339 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 12 states. [2018-11-23 06:58:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:09,734 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2018-11-23 06:58:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:58:09,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-23 06:58:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:09,736 INFO L225 Difference]: With dead ends: 74 [2018-11-23 06:58:09,736 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 06:58:09,736 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 06:58:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 06:58:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-23 06:58:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 06:58:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 06:58:09,745 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 48 [2018-11-23 06:58:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:09,745 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-23 06:58:09,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:58:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 06:58:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 06:58:09,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:09,748 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:09,748 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:09,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash 125205893, now seen corresponding path program 1 times [2018-11-23 06:58:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:09,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:09,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 06:58:09,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:09,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:09,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 06:58:09,792 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [51], [53], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:09,793 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:09,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:09,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:09,830 INFO L272 AbstractInterpreter]: Visited 35 different actions 91 times. Merged at 7 different actions 30 times. Never widened. Performed 386 root evaluator evaluations with a maximum evaluation depth of 3. Performed 386 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-23 06:58:09,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:09,842 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:09,869 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 81.06% of their original sizes. [2018-11-23 06:58:09,869 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:09,952 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 06:58:09,952 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:09,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:58:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-23 06:58:09,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:09,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 06:58:09,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 06:58:09,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 06:58:09,954 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 14 states. [2018-11-23 06:58:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:10,394 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 06:58:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 06:58:10,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-11-23 06:58:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:10,395 INFO L225 Difference]: With dead ends: 66 [2018-11-23 06:58:10,395 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 06:58:10,395 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-23 06:58:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 06:58:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 49. [2018-11-23 06:58:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 06:58:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-11-23 06:58:10,403 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 50 [2018-11-23 06:58:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:10,404 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-11-23 06:58:10,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 06:58:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-11-23 06:58:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 06:58:10,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:10,405 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:10,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:10,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 395797120, now seen corresponding path program 1 times [2018-11-23 06:58:10,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:10,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:10,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:10,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:10,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:58:10,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:10,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:10,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 06:58:10,423 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:10,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:10,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:10,652 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:58:10,653 INFO L272 AbstractInterpreter]: Visited 30 different actions 145 times. Merged at 14 different actions 67 times. Widened at 1 different actions 2 times. Performed 701 root evaluator evaluations with a maximum evaluation depth of 10. Performed 701 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 19 fixpoints after 7 different actions. Largest state had 23 variables. [2018-11-23 06:58:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:10,662 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:58:10,693 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 86.31% of their original sizes. [2018-11-23 06:58:10,693 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:58:10,736 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-23 06:58:10,736 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:58:10,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:58:10,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 06:58:10,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:58:10,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:58:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:58:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:58:10,737 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 8 states. [2018-11-23 06:58:10,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:10,918 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-23 06:58:10,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:58:10,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-23 06:58:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:10,920 INFO L225 Difference]: With dead ends: 73 [2018-11-23 06:58:10,920 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 06:58:10,920 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:58:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 06:58:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 06:58:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 06:58:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2018-11-23 06:58:10,926 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 51 [2018-11-23 06:58:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:10,926 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2018-11-23 06:58:10,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:58:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2018-11-23 06:58:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 06:58:10,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:10,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:10,928 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:10,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash -515269076, now seen corresponding path program 1 times [2018-11-23 06:58:10,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:10,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:10,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:10,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:58:10,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:10,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:10,943 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 06:58:10,944 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [60], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:10,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:10,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:11,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:58:11,327 INFO L272 AbstractInterpreter]: Visited 38 different actions 251 times. Merged at 22 different actions 125 times. Widened at 2 different actions 5 times. Performed 1169 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1169 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 36 fixpoints after 11 different actions. Largest state had 25 variables. [2018-11-23 06:58:11,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:11,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:58:11,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:11,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:11,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:58:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:11,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 06:58:11,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 06:58:11,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:11,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:58:11,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:11,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:58:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:58:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:11,503 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 6 states. [2018-11-23 06:58:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:11,521 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-11-23 06:58:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:58:11,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-23 06:58:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:11,524 INFO L225 Difference]: With dead ends: 95 [2018-11-23 06:58:11,524 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 06:58:11,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 06:58:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 06:58:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 06:58:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 06:58:11,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 53 [2018-11-23 06:58:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:11,531 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 06:58:11,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:58:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 06:58:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 06:58:11,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:11,532 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:11,532 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:11,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash -871058906, now seen corresponding path program 2 times [2018-11-23 06:58:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:11,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:11,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:11,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-11-23 06:58:11,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:11,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:58:11,555 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:11,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:11,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:11,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:11,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:58:11,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:58:11,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:58:11,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:11,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 06:58:11,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 06:58:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 06:58:11,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:11,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 06:58:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:58:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:58:11,668 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-11-23 06:58:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:11,739 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2018-11-23 06:58:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:58:11,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 06:58:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:11,741 INFO L225 Difference]: With dead ends: 104 [2018-11-23 06:58:11,741 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 06:58:11,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:58:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 06:58:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 06:58:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 06:58:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-11-23 06:58:11,749 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 59 [2018-11-23 06:58:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:11,750 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-11-23 06:58:11,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 06:58:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-11-23 06:58:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 06:58:11,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:11,751 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:11,751 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:11,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1442887404, now seen corresponding path program 1 times [2018-11-23 06:58:11,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:11,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:11,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:11,761 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:11,761 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:11,761 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:11,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:11,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:11,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2018-11-23 06:58:11,820 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [9], [11], [17], [19], [21], [25], [27], [30], [31], [38], [44], [46], [49], [51], [53], [59], [61], [62], [68], [70], [72], [76], [77], [78], [79], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-23 06:58:11,822 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:58:11,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:58:12,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 06:58:12,016 INFO L272 AbstractInterpreter]: Visited 37 different actions 114 times. Merged at 9 different actions 38 times. Never widened. Performed 524 root evaluator evaluations with a maximum evaluation depth of 10. Performed 524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 12 fixpoints after 6 different actions. Largest state had 25 variables. [2018-11-23 06:58:12,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:12,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 06:58:12,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:12,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:12,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:58:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:12,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 06:58:12,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2018-11-23 06:58:12,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:12,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:58:12,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:12,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:58:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:58:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:12,211 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 12 states. [2018-11-23 06:58:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:12,248 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2018-11-23 06:58:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:58:12,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-23 06:58:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:12,250 INFO L225 Difference]: With dead ends: 127 [2018-11-23 06:58:12,250 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 06:58:12,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 06:58:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 06:58:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 06:58:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-23 06:58:12,258 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 101 [2018-11-23 06:58:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:12,259 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-23 06:58:12,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:58:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-23 06:58:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 06:58:12,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:12,260 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:12,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:12,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash -992722080, now seen corresponding path program 2 times [2018-11-23 06:58:12,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:12,276 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:12,276 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:12,277 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:12,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:12,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:12,337 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:12,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:12,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:12,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:12,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:58:12,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:58:12,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 06:58:12,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:12,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 06:58:12,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-11-23 06:58:12,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:12,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:58:12,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:58:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:58:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:12,504 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2018-11-23 06:58:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:12,531 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-11-23 06:58:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:58:12,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-23 06:58:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:12,534 INFO L225 Difference]: With dead ends: 123 [2018-11-23 06:58:12,535 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 06:58:12,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 06:58:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 06:58:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 06:58:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-11-23 06:58:12,547 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 113 [2018-11-23 06:58:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:12,547 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-11-23 06:58:12,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:58:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-11-23 06:58:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 06:58:12,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:12,549 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 10, 10, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:12,549 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:12,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash -748407238, now seen corresponding path program 3 times [2018-11-23 06:58:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:12,568 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:12,568 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:12,568 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:12,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:12,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:12,638 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:12,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:12,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:12,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:58:12,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:58:12,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:58:12,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:12,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 06:58:12,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 23 proven. 250 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-23 06:58:12,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:12,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 06:58:12,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:12,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:58:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:58:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:58:12,767 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 6 states. [2018-11-23 06:58:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:12,801 INFO L93 Difference]: Finished difference Result 156 states and 197 transitions. [2018-11-23 06:58:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 06:58:12,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-23 06:58:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:12,802 INFO L225 Difference]: With dead ends: 156 [2018-11-23 06:58:12,803 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 06:58:12,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 233 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 06:58:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 06:58:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-23 06:58:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 06:58:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-11-23 06:58:12,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 119 [2018-11-23 06:58:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:12,812 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-11-23 06:58:12,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:58:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-11-23 06:58:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 06:58:12,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:12,813 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:12,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:12,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash -788952678, now seen corresponding path program 4 times [2018-11-23 06:58:12,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:12,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:12,825 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:12,825 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:12,825 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:12,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:12,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:12,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:12,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:12,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:12,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:12,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:12,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:58:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:12,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-11-23 06:58:13,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2018-11-23 06:58:13,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:13,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-11-23 06:58:13,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:13,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 06:58:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 06:58:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:58:13,182 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 22 states. [2018-11-23 06:58:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:13,224 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2018-11-23 06:58:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 06:58:13,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2018-11-23 06:58:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:13,231 INFO L225 Difference]: With dead ends: 189 [2018-11-23 06:58:13,231 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 06:58:13,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 269 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 06:58:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 06:58:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-23 06:58:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 06:58:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-11-23 06:58:13,241 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 146 [2018-11-23 06:58:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:13,243 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-11-23 06:58:13,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 06:58:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-11-23 06:58:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 06:58:13,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:13,244 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 15, 12, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:13,244 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1590673490, now seen corresponding path program 5 times [2018-11-23 06:58:13,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:13,263 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:13,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:13,263 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:13,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:13,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:13,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:13,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:13,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:13,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:58:13,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:58:13,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 06:58:13,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:13,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 532 proven. 16 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2018-11-23 06:58:13,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2018-11-23 06:58:13,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:13,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:58:13,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:13,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:58:13,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:58:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:13,487 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 12 states. [2018-11-23 06:58:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:13,511 INFO L93 Difference]: Finished difference Result 185 states and 220 transitions. [2018-11-23 06:58:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:58:13,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-11-23 06:58:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:13,514 INFO L225 Difference]: With dead ends: 185 [2018-11-23 06:58:13,514 INFO L226 Difference]: Without dead ends: 143 [2018-11-23 06:58:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-23 06:58:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-11-23 06:58:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 06:58:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-11-23 06:58:13,524 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 166 [2018-11-23 06:58:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:13,524 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-11-23 06:58:13,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:58:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-11-23 06:58:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 06:58:13,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:13,526 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 20, 20, 15, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:13,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:13,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1538927878, now seen corresponding path program 6 times [2018-11-23 06:58:13,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:13,540 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:13,540 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:13,540 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:13,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:13,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:13,613 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:13,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:13,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:13,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:13,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:58:13,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:58:13,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:58:13,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:13,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2018-11-23 06:58:13,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 65 proven. 556 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2018-11-23 06:58:13,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:13,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 06:58:13,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:58:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:58:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:13,801 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-11-23 06:58:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:13,832 INFO L93 Difference]: Finished difference Result 251 states and 295 transitions. [2018-11-23 06:58:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:58:13,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2018-11-23 06:58:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:13,834 INFO L225 Difference]: With dead ends: 251 [2018-11-23 06:58:13,834 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 06:58:13,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 06:58:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-11-23 06:58:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 06:58:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2018-11-23 06:58:13,846 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 178 [2018-11-23 06:58:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:13,847 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2018-11-23 06:58:13,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:58:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2018-11-23 06:58:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-23 06:58:13,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:13,852 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 30, 20, 20, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:13,852 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:13,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1667140602, now seen corresponding path program 7 times [2018-11-23 06:58:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:13,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:13,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:13,866 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:13,866 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:13,866 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:13,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:13,932 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:13,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:13,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:13,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:13,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:13,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 06:58:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:14,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 1133 proven. 155 refuted. 0 times theorem prover too weak. 2332 trivial. 0 not checked. [2018-11-23 06:58:14,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 149 proven. 1573 refuted. 0 times theorem prover too weak. 1898 trivial. 0 not checked. [2018-11-23 06:58:14,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:14,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 06:58:14,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:14,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 06:58:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:58:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:58:14,198 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand 13 states. [2018-11-23 06:58:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:14,244 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2018-11-23 06:58:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:58:14,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 232 [2018-11-23 06:58:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:14,245 INFO L225 Difference]: With dead ends: 272 [2018-11-23 06:58:14,245 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 06:58:14,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 442 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:58:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 06:58:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-11-23 06:58:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 06:58:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-11-23 06:58:14,255 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 232 [2018-11-23 06:58:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:14,256 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-11-23 06:58:14,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 06:58:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-11-23 06:58:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-23 06:58:14,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:14,259 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 33, 20, 20, 15, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:14,259 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:14,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:14,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1163837658, now seen corresponding path program 8 times [2018-11-23 06:58:14,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:14,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:14,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:14,275 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:14,275 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:14,275 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:14,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:14,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:14,342 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:14,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:14,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:14,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:14,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 06:58:14,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 06:58:14,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 06:58:14,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:14,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4043 backedges. 743 proven. 40 refuted. 0 times theorem prover too weak. 3260 trivial. 0 not checked. [2018-11-23 06:58:14,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4043 backedges. 743 proven. 40 refuted. 0 times theorem prover too weak. 3260 trivial. 0 not checked. [2018-11-23 06:58:14,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 06:58:14,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:14,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:58:14,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:58:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:14,768 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 12 states. [2018-11-23 06:58:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:14,805 INFO L93 Difference]: Finished difference Result 287 states and 333 transitions. [2018-11-23 06:58:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 06:58:14,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 241 [2018-11-23 06:58:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:14,807 INFO L225 Difference]: With dead ends: 287 [2018-11-23 06:58:14,807 INFO L226 Difference]: Without dead ends: 176 [2018-11-23 06:58:14,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 467 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:58:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-23 06:58:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-11-23 06:58:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 06:58:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2018-11-23 06:58:14,819 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 241 [2018-11-23 06:58:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:14,819 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2018-11-23 06:58:14,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:58:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2018-11-23 06:58:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-23 06:58:14,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:14,821 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:58:14,821 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash -360124326, now seen corresponding path program 9 times [2018-11-23 06:58:14,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:14,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:14,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:14,836 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:14,837 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:14,837 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:14,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:14,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:58:14,922 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 06:58:14,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 06:58:14,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:58:14,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:58:14,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 06:58:14,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 06:58:14,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 06:58:14,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 06:58:14,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:58:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 2490 proven. 100 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2018-11-23 06:58:15,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 06:58:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2018-11-23 06:58:15,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:58:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-11-23 06:58:15,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 06:58:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 06:58:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 06:58:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:58:15,225 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand 21 states. [2018-11-23 06:58:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:58:15,270 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2018-11-23 06:58:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 06:58:15,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 277 [2018-11-23 06:58:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:58:15,271 INFO L225 Difference]: With dead ends: 287 [2018-11-23 06:58:15,271 INFO L226 Difference]: Without dead ends: 212 [2018-11-23 06:58:15,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 531 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 06:58:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-23 06:58:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-11-23 06:58:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 06:58:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 232 transitions. [2018-11-23 06:58:15,281 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 232 transitions. Word has length 277 [2018-11-23 06:58:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:58:15,281 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 232 transitions. [2018-11-23 06:58:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 06:58:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 232 transitions. [2018-11-23 06:58:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-23 06:58:15,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:58:15,283 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 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 06:58:15,283 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:58:15,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:58:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash -657380760, now seen corresponding path program 10 times [2018-11-23 06:58:15,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:58:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:15,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:58:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:58:15,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:58:15,297 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 06:58:15,297 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 06:58:15,297 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffb09ef6-2ae0-4b01-835c-e359fb353837/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 06:58:15,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:58:15,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-11-23 06:58:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 06:58:17,363 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-11-23 06:58:17,363 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] assume true; [?] RET #78#return; [?] CALL call #t~ret12 := main(); [?] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(80); [?] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !!(~i~0 < 20);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4);havoc #t~nondet1; [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; [?] assume !(~i~0 < 20); [?] assume true; [?] RET #82#return; [?] havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; [?] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 20); [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [?] assume true; [?] RET #84#return; [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [?] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 20); [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [?] assume true; [?] RET #86#return; [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !!(~i~2 < 19);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; [?] #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; [?] assume !(~i~2 < 19); [?] call write~int(~temp~0, ~#x~0.base, 76 + ~#x~0.offset, 4); [?] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [?] ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := 0;~cnt~0 := 0;~i~1 := 0; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume !(~i~1 > 10); [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !!(~i~1 < 20); [?] assume ~i~1 > 10;call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4);~ret~0 := ~ret~0 + #t~mem3;havoc #t~mem3;~cnt~0 := 1 + ~cnt~0; [?] #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; [?] assume !(~i~1 < 20); [?] assume 0 != ~cnt~0;#res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [?] assume true; [?] RET #88#return; [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; [?] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [?] assume !false; [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 20); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 19); [L46] call write~int(~temp~0, ~#x~0.base, 76 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0.base, ~#x~0.offset); [L4-L9] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !!(~i~0 < 20); [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] call write~int(#t~nondet1, ~x.base, ~x.offset + 4 * ~i~0, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] assume !(~i~0 < 20); [L4-L9] ensures true; [L32] RET call init_nondet(~#x~0.base, ~#x~0.offset); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L38] RET call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L40] call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4); [L40] havoc #t~mem6; [L40] call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L41] RET call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !!(~i~2 < 19); [L44] call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4); [L44] call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] assume !(~i~2 < 19); [L46] call write~int(~temp~0, ~#x~0.base, 76 + ~#x~0.offset, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L11-L27] ~x.base, ~x.offset := #in~x.base, #in~x.offset; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume !(~i~1 > 10); [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !!(~i~1 < 20); [L18-L21] assume ~i~1 > 10; [L19] call #t~mem3 := read~int(~x.base, ~x.offset + 4 * ~i~1, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] assume !(~i~1 < 20); [L23-L26] assume 0 != ~cnt~0; [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L11-L27] ensures true; [L47] RET call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49-L51] assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 20) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 19) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 76 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 20) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 19) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 76 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 20) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 19) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 76 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret12 := main(); [L31] FCALL call ~#x~0 := #Ultimate.alloc(80); [L32] CALL call init_nondet(~#x~0); [L4-L9] ~x := #in~x; [L5] havoc ~i~0; [L6] ~i~0 := 0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND FALSE !(!(~i~0 < 20)) [L7] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L7] FCALL call write~int(#t~nondet1, { base: ~x!base, offset: ~x!offset + 4 * ~i~0 }, 4); [L7] havoc #t~nondet1; [L6] #t~post0 := ~i~0; [L6] ~i~0 := 1 + #t~post0; [L6] havoc #t~post0; [L6-L8] COND TRUE !(~i~0 < 20) [L32] RET call init_nondet(~#x~0); [L33] havoc ~temp~0; [L34] havoc ~ret~1; [L35] havoc ~ret2~0; [L36] havoc ~ret5~0; [L38] CALL call #t~ret4 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L38] RET call #t~ret4 := rangesum(~#x~0); [L38] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L38] ~ret~1 := #t~ret4; [L38] havoc #t~ret4; [L40] FCALL call #t~mem5 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] ~temp~0 := #t~mem5; [L40] havoc #t~mem5; [L40] FCALL call #t~mem6 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L40] FCALL call write~int(#t~mem6, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L40] havoc #t~mem6; [L40] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L41] CALL call #t~ret7 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L41] RET call #t~ret7 := rangesum(~#x~0); [L41] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L41] ~ret2~0 := #t~ret7; [L41] havoc #t~ret7; [L42] FCALL call #t~mem8 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L42] ~temp~0 := #t~mem8; [L42] havoc #t~mem8; [L43] ~i~2 := 0; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND FALSE !(!(~i~2 < 19)) [L44] FCALL call #t~mem10 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset + 4 * (1 + ~i~2) }, 4); [L44] FCALL call write~int(#t~mem10, { base: ~#x~0!base, offset: ~#x~0!offset + 4 * ~i~2 }, 4); [L44] havoc #t~mem10; [L43] #t~post9 := ~i~2; [L43] ~i~2 := 1 + #t~post9; [L43] havoc #t~post9; [L43-L45] COND TRUE !(~i~2 < 19) [L46] FCALL call write~int(~temp~0, { base: ~#x~0!base, offset: 76 + ~#x~0!offset }, 4); [L47] CALL call #t~ret11 := rangesum(~#x~0); [L11-L27] ~x := #in~x; [L13] havoc ~i~1; [L14] havoc ~ret~0; [L15] ~ret~0 := 0; [L16] ~cnt~0 := 0; [L17] ~i~1 := 0; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND FALSE !(~i~1 > 10) [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND FALSE !(!(~i~1 < 20)) [L18] COND TRUE ~i~1 > 10 [L19] FCALL call #t~mem3 := read~int({ base: ~x!base, offset: ~x!offset + 4 * ~i~1 }, 4); [L19] ~ret~0 := ~ret~0 + #t~mem3; [L19] havoc #t~mem3; [L20] ~cnt~0 := 1 + ~cnt~0; [L17] #t~post2 := ~i~1; [L17] ~i~1 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L22] COND TRUE !(~i~1 < 20) [L23] COND TRUE 0 != ~cnt~0 [L24] #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % ~cnt~0 then (if ~cnt~0 < 0 then ~ret~0 / ~cnt~0 - 1 else 1 + ~ret~0 / ~cnt~0) else ~ret~0 / ~cnt~0) % 4294967296 - 4294967296); [L47] RET call #t~ret11 := rangesum(~#x~0); [L47] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; [L47] ~ret5~0 := #t~ret11; [L47] havoc #t~ret11; [L49] COND TRUE ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0 [L50] assert false; [L31] int x[20]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 20) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<20 -1) [L46] x[20 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() ----- [2018-11-23 06:58:18,496 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-11-23 06:58:18,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:58:18 BoogieIcfgContainer [2018-11-23 06:58:18,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:58:18,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:58:18,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:58:18,497 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:58:18,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:58:07" (3/4) ... [2018-11-23 06:58:18,501 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:58:18,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:58:18,501 INFO L168 Benchmark]: Toolchain (without parser) took 11285.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 961.9 MB in the beginning and 1.3 GB in the end (delta: -368.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:58:18,503 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:58:18,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.95 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:58:18,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.37 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 06:58:18,504 INFO L168 Benchmark]: Boogie Preprocessor took 53.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:58:18,504 INFO L168 Benchmark]: RCFGBuilder took 207.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:58:18,504 INFO L168 Benchmark]: TraceAbstraction took 10838.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.2 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:58:18,505 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:58:18,507 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.95 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.37 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 53.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 207.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10838.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.2 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 50]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L31] int x[20]; [L32] CALL init_nondet(x) [L5] int i; [L6] i = 0 [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 20 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 20) [L32] RET init_nondet(x) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L38] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] RET, EXPR rangesum(x) [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L41] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] RET, EXPR rangesum(x) [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<20 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<20 -1) [L46] x[20 -1] = temp [L47] CALL, EXPR rangesum(x) [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND FALSE !(i > 20/2) [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 20 [L18] COND TRUE i > 20/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 20) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] RET, EXPR rangesum(x) [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNKNOWN Result, 10.7s OverallTime, 18 OverallIterations, 60 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 553 SDtfs, 373 SDslu, 1609 SDs, 0 SdLazy, 321 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 3646 GetRequests, 3463 SyntacticMatches, 19 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.8930923737103509 AbsIntWeakeningRatio, 1.1797752808988764 AbsIntAvgWeakeningVarsNumRemoved, 3.3895131086142323 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3938 NumberOfCodeBlocks, 3524 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3444 ConstructedInterpolants, 0 QuantifiedInterpolants, 729690 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3416 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 24 InterpolantComputations, 0 PerfectInterpolantSequences, 37079/40217 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...