./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a7af5709195f6c1eec73f2559f8e654af4840835 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:58:45,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:58:45,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:58:45,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:58:45,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:58:45,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:58:45,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:58:45,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:58:45,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:58:45,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:58:45,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:58:45,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:58:45,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:58:45,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:58:45,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:58:45,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:58:45,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:58:45,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:58:45,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:58:45,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:58:45,317 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:58:45,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:58:45,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:58:45,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:58:45,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:58:45,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:58:45,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:58:45,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:58:45,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:58:45,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:58:45,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:58:45,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:58:45,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:58:45,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:58:45,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:58:45,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:58:45,326 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 07:58:45,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:58:45,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:58:45,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:58:45,339 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:58:45,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:58:45,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:58:45,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 07:58:45,340 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:58:45,341 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:58:45,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:58:45,341 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:58:45,341 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:58:45,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:58:45,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:58:45,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:58:45,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:58:45,342 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7af5709195f6c1eec73f2559f8e654af4840835 [2018-11-23 07:58:45,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:58:45,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:58:45,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:58:45,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:58:45,382 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:58:45,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 07:58:45,425 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/data/56639d0a9/a51b03b22dc84030b5a729723f119312/FLAG7473d4bf8 [2018-11-23 07:58:45,749 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:58:45,749 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 07:58:45,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/data/56639d0a9/a51b03b22dc84030b5a729723f119312/FLAG7473d4bf8 [2018-11-23 07:58:46,185 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/data/56639d0a9/a51b03b22dc84030b5a729723f119312 [2018-11-23 07:58:46,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:58:46,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:58:46,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:58:46,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:58:46,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:58:46,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1173d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46, skipping insertion in model container [2018-11-23 07:58:46,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:58:46,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:58:46,335 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:58:46,337 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:58:46,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:58:46,358 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:58:46,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46 WrapperNode [2018-11-23 07:58:46,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:58:46,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:58:46,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:58:46,360 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:58:46,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:58:46,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:58:46,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:58:46,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:58:46,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:58:46,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:58:46,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:58:46,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:58:46,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:58:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 07:58:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-23 07:58:46,461 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-23 07:58:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:58:46,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:58:46,592 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:58:46,592 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 07:58:46,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:58:46 BoogieIcfgContainer [2018-11-23 07:58:46,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:58:46,594 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:58:46,594 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:58:46,602 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:58:46,603 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:58:46" (1/1) ... [2018-11-23 07:58:46,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:58:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 30 states and 36 transitions. [2018-11-23 07:58:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 07:58:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 07:58:46,641 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 32 states and 40 transitions. [2018-11-23 07:58:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 07:58:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:58:46,835 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 36 states and 47 transitions. [2018-11-23 07:58:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-23 07:58:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:58:47,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 35 states and 46 transitions. [2018-11-23 07:58:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-11-23 07:58:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 07:58:47,108 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 38 states and 51 transitions. [2018-11-23 07:58:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2018-11-23 07:58:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:58:47,269 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 38 states and 49 transitions. [2018-11-23 07:58:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 07:58:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:58:47,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 38 states and 48 transitions. [2018-11-23 07:58:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 07:58:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:58:47,586 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:58:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 37 states and 47 transitions. [2018-11-23 07:58:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 07:58:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:58:47,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 37 states and 46 transitions. [2018-11-23 07:58:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 07:58:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 07:58:47,887 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:58:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 22 states and 26 transitions. [2018-11-23 07:58:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 07:58:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 07:58:48,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 32 states and 44 transitions. [2018-11-23 07:58:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2018-11-23 07:58:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 07:58:48,716 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:58:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 58 transitions. [2018-11-23 07:58:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2018-11-23 07:58:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:58:49,484 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:58:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 07:58:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:58:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 35 states and 47 transitions. [2018-11-23 07:58:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2018-11-23 07:58:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:58:49,596 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:58:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:58:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:58:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:58:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:58:49,648 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 13 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~m~0=2147483647] [?] assume !(main_~m~0 < 0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=3] [?] assume !(main_~n~0 < 0); VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=3] [?] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [|mult_#in~m|=3, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=2, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647, |mult_#res|=0] [?] RET #55#return; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#res|=2147483647] [?] assume true; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#res|=2147483647] [?] RET #55#return; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27-L29] assume !(main_~m~0 < 0); [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31-L33] assume !(main_~n~0 < 0); VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27-L29] assume !(main_~m~0 < 0); [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31-L33] assume !(main_~n~0 < 0); VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27] COND FALSE !(main_~m~0 < 0) [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31] COND FALSE !(main_~n~0 < 0) VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27] COND FALSE !(main_~m~0 < 0) [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31] COND FALSE !(main_~n~0 < 0) VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; [L31] COND FALSE !(~n~0 < 0) [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; [L31] COND FALSE !(~n~0 < 0) [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) [L34] CALL mult(m, n) VAL [\old(m)=3, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=2147483647, m=0, n=2147483647] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=2147483647, \result=0, m=0, n=2147483647] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647, m=1, mult(n, m - 1)=0, n=2147483647] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] ----- [2018-11-23 07:58:49,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:58:49 ImpRootNode [2018-11-23 07:58:49,721 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:58:49,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:58:49,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:58:49,733 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:58:49,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:58:46" (3/4) ... [2018-11-23 07:58:49,736 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~m~0=2147483647] [?] assume !(main_~m~0 < 0);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=3] [?] assume !(main_~n~0 < 0); VAL [ULTIMATE.start_main_~m~0=2147483647, ULTIMATE.start_main_~n~0=3] [?] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [|mult_#in~m|=3, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=3, mult_~n=2147483647, |mult_#in~m|=3, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=2, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=2147483647] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=2147483647, |mult_#in~m|=0, |mult_#in~n|=2147483647, |mult_#res|=0] [?] RET #55#return; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#res|=2147483647] [?] assume true; VAL [mult_~m=1, mult_~n=2147483647, |mult_#in~m|=1, |mult_#in~n|=2147483647, |mult_#res|=2147483647] [?] RET #55#return; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=2147483647, |mult_#in~m|=2, |mult_#in~n|=2147483647, |mult_#t~ret1|=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27-L29] assume !(main_~m~0 < 0); [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31-L33] assume !(main_~n~0 < 0); VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27-L29] assume !(main_~m~0 < 0); [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31-L33] assume !(main_~n~0 < 0); VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L15-L23] ensures true; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27] COND FALSE !(main_~m~0 < 0) [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31] COND FALSE !(main_~n~0 < 0) VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_~m~0, main_~n~0, main_~res1~0, main_~res2~0; [L26] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L26] main_~m~0 := main_#t~nondet2; [L26] havoc main_#t~nondet2; VAL [main_~m~0=2147483647] [L27] COND FALSE !(main_~m~0 < 0) [L30] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L30] main_~n~0 := main_#t~nondet3; [L30] havoc main_#t~nondet3; VAL [main_~m~0=2147483647, main_~n~0=3] [L31] COND FALSE !(main_~n~0 < 0) VAL [main_~m~0=2147483647, main_~n~0=3] [L34] CALL call main_#t~ret4 := mult(main_~m~0, main_~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; [L31] COND FALSE !(~n~0 < 0) [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; [L31] COND FALSE !(~n~0 < 0) [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=3, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=3, #in~n=2147483647, ~m=3, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=2147483647, ~m=2, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=2147483647, ~m=1, ~n=2147483647] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=2147483647] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=2147483647, ~m=0, ~n=2147483647] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=2147483647, #res=0, ~m=0, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=2147483647, #t~ret1=0, ~m=1, ~n=2147483647] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=2147483647, #res=2147483647, ~m=1, ~n=2147483647] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=2147483647, #t~ret1=2147483647, ~m=2, ~n=2147483647] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) [L34] CALL mult(m, n) VAL [\old(m)=3, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=2147483647, m=0, n=2147483647] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=2147483647, \result=0, m=0, n=2147483647] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647, m=1, mult(n, m - 1)=0, n=2147483647] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] ----- [2018-11-23 07:58:49,807 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2d815fc7-adc7-46e0-865c-913cef10c6ee/bin-2019/ukojak/witness.graphml [2018-11-23 07:58:49,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:58:49,807 INFO L168 Benchmark]: Toolchain (without parser) took 3617.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 959.2 MB in the beginning and 942.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 183.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,808 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:58:49,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,812 INFO L168 Benchmark]: Boogie Preprocessor took 10.50 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,812 INFO L168 Benchmark]: RCFGBuilder took 202.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,813 INFO L168 Benchmark]: CodeCheck took 3138.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 156.6 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,813 INFO L168 Benchmark]: Witness Printer took 73.87 ms. Allocated memory is still 1.2 GB. Free memory was 947.4 MB in the beginning and 942.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:58:49,816 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 33 locations, 6 error locations. UNSAFE Result, 3.0s OverallTime, 13 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26904 SDtfs, 24540 SDslu, 1912 SDs, 0 SdLazy, 138654 SolverSat, 41190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1442 SyntacticMatches, 40 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 5317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 28/37 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) [L34] CALL mult(m, n) VAL [\old(m)=3, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=3, \old(n)=2147483647, m=3, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=2147483647, m=2, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=2147483647, m=1, n=2147483647] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=2147483647] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=2147483647, m=0, n=2147483647] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=2147483647, \result=0, m=0, n=2147483647] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=2147483647, m=1, mult(n, m - 1)=0, n=2147483647] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=2147483647, m=2, mult(n, m - 1)=2147483647, n=2147483647] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.50 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 202.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * CodeCheck took 3138.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.9 MB). Free memory was 1.1 GB in the beginning and 947.4 MB in the end (delta: 156.6 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. * Witness Printer took 73.87 ms. Allocated memory is still 1.2 GB. Free memory was 947.4 MB in the beginning and 942.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...