./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c292d0c9d9c055df9398b3303a92d6621b60758 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:41:32,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:41:32,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:41:32,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:41:32,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:41:32,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:41:32,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:41:32,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:41:32,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:41:32,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:41:32,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:41:32,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:41:32,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:41:32,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:41:32,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:41:32,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:41:32,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:41:32,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:41:32,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:41:32,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:41:32,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:41:32,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:41:32,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:41:32,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:41:32,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:41:32,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:41:32,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:41:32,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:41:32,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:41:32,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:41:32,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:41:32,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:41:32,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:41:32,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:41:32,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:41:32,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:41:32,814 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 14:41:32,826 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:41:32,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:41:32,827 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:41:32,827 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 14:41:32,827 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:41:32,828 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:41:32,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:41:32,828 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:41:32,828 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:41:32,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:41:32,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:41:32,829 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:41:32,829 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:41:32,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:41:32,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:41:32,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:41:32,830 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_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c292d0c9d9c055df9398b3303a92d6621b60758 [2018-11-23 14:41:32,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:41:32,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:41:32,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:41:32,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:41:32,872 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:41:32,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 14:41:32,916 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/data/a01c9dc1e/836f61b69db941d584dba100edf01eb2/FLAGfdf89ca97 [2018-11-23 14:41:33,267 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:41:33,268 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/sv-benchmarks/c/recursive-simple/id_o10_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 14:41:33,272 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/data/a01c9dc1e/836f61b69db941d584dba100edf01eb2/FLAGfdf89ca97 [2018-11-23 14:41:33,283 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/data/a01c9dc1e/836f61b69db941d584dba100edf01eb2 [2018-11-23 14:41:33,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:41:33,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:41:33,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:33,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:41:33,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:41:33,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4675c7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33, skipping insertion in model container [2018-11-23 14:41:33,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:41:33,315 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:41:33,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:33,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:41:33,456 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:33,466 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:41:33,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33 WrapperNode [2018-11-23 14:41:33,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:33,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:33,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:41:33,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:41:33,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:33,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:41:33,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:41:33,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:41:33,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:41:33,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:41:33,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:41:33,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:41:33,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/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 14:41:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:41:33,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:41:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 14:41:33,599 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 14:41:33,706 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:41:33,706 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 14:41:33,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:33 BoogieIcfgContainer [2018-11-23 14:41:33,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:41:33,707 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:41:33,707 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:41:33,717 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:41:33,717 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:33" (1/1) ... [2018-11-23 14:41:33,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:41:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 14:41:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 14:41:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:41:33,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:33,936 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 14:41:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 18 states and 21 transitions. [2018-11-23 14:41:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 14:41:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:41:34,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:41:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 23 states and 27 transitions. [2018-11-23 14:41:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 14:41:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:41:34,389 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 14:41:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2018-11-23 14:41:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 14:41:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:41:34,802 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 14:41:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 33 states and 39 transitions. [2018-11-23 14:41:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 14:41:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 14:41:35,341 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 14:41:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2018-11-23 14:41:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 14:41:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 14:41:35,868 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 14:41:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 43 states and 51 transitions. [2018-11-23 14:41:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 14:41:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 14:41:36,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 14:41:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2018-11-23 14:41:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 14:41:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 14:41:37,233 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-23 14:41:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 53 states and 63 transitions. [2018-11-23 14:41:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-23 14:41:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 14:41:38,050 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 14:41:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 58 states and 69 transitions. [2018-11-23 14:41:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 14:41:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 14:41:39,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 14:41:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 63 states and 75 transitions. [2018-11-23 14:41:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-23 14:41:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 14:41:40,476 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:40,791 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 11 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] CALL call main_#t~ret2 := id(main_~input~0); VAL [|id_#in~x|=(- 12884901878)] [?] ~x := #in~x; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901879)] [?] ~x := #in~x; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901880)] [?] ~x := #in~x; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901881)] [?] ~x := #in~x; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901882)] [?] ~x := #in~x; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901883)] [?] ~x := #in~x; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901884)] [?] ~x := #in~x; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901885)] [?] ~x := #in~x; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901886)] [?] ~x := #in~x; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901887)] [?] ~x := #in~x; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901888)] [?] ~x := #in~x; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888)] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888), |id_#res|=0] [?] assume true; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888), |id_#res|=0] [?] RET #26#return; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#res|=1] [?] assume true; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#res|=1] [?] RET #26#return; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#res|=2] [?] assume true; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#res|=2] [?] RET #26#return; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#res|=3] [?] assume true; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#res|=3] [?] RET #26#return; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#res|=4] [?] assume true; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#res|=4] [?] RET #26#return; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#res|=5] [?] assume true; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#res|=5] [?] RET #26#return; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#res|=6] [?] assume true; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#res|=6] [?] RET #26#return; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#res|=7] [?] assume true; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#res|=7] [?] RET #26#return; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#res|=8] [?] assume true; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#res|=8] [?] RET #26#return; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#res|=9] [?] assume true; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#res|=9] [?] RET #26#return; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#res|=10] [?] assume true; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#res|=10] [?] RET #24#return; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), |ULTIMATE.start_main_#t~ret2|=10] [?] main_~result~0 := main_#t~ret2;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] assume 10 == main_~result~0 % 4294967296; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L4-L7] ensures true; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L4-L7] ensures true; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L4-L7] ensures true; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L4-L7] ensures true; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L4-L7] ensures true; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L4-L7] ensures true; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L4-L7] ensures true; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L4-L7] ensures true; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L4-L7] ensures true; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L4-L7] ensures true; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L4-L7] ensures true; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12-L14] assume 10 == main_~result~0 % 4294967296; VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L4-L7] ensures true; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L4-L7] ensures true; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L4-L7] ensures true; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L4-L7] ensures true; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L4-L7] ensures true; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L4-L7] ensures true; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L4-L7] ensures true; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L4-L7] ensures true; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L4-L7] ensures true; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L4-L7] ensures true; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L4-L7] ensures true; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12-L14] assume 10 == main_~result~0 % 4294967296; VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12] COND TRUE 10 == main_~result~0 % 4294967296 VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12] COND TRUE 10 == main_~result~0 % 4294967296 VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 10 == ~result~0 % 4294967296 [L13] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 10 == ~result~0 % 4294967296 [L13] assert false; [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 [L13] __VERIFIER_error() ----- [2018-11-23 14:41:40,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:41:40 ImpRootNode [2018-11-23 14:41:40,884 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:41:40,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:41:40,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:41:40,885 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:41:40,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:33" (3/4) ... [2018-11-23 14:41:40,887 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; [?] CALL call main_#t~ret2 := id(main_~input~0); VAL [|id_#in~x|=(- 12884901878)] [?] ~x := #in~x; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901879)] [?] ~x := #in~x; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901880)] [?] ~x := #in~x; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901881)] [?] ~x := #in~x; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901882)] [?] ~x := #in~x; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901883)] [?] ~x := #in~x; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901884)] [?] ~x := #in~x; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901885)] [?] ~x := #in~x; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901886)] [?] ~x := #in~x; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901887)] [?] ~x := #in~x; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887)] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887)] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=(- 12884901888)] [?] ~x := #in~x; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888)] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888), |id_#res|=0] [?] assume true; VAL [id_~x=(- 12884901888), |id_#in~x|=(- 12884901888), |id_#res|=0] [?] RET #26#return; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#res|=1] [?] assume true; VAL [id_~x=(- 12884901887), |id_#in~x|=(- 12884901887), |id_#res|=1] [?] RET #26#return; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#res|=2] [?] assume true; VAL [id_~x=(- 12884901886), |id_#in~x|=(- 12884901886), |id_#res|=2] [?] RET #26#return; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#res|=3] [?] assume true; VAL [id_~x=(- 12884901885), |id_#in~x|=(- 12884901885), |id_#res|=3] [?] RET #26#return; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#t~ret0|=3] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#res|=4] [?] assume true; VAL [id_~x=(- 12884901884), |id_#in~x|=(- 12884901884), |id_#res|=4] [?] RET #26#return; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#t~ret0|=4] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#res|=5] [?] assume true; VAL [id_~x=(- 12884901883), |id_#in~x|=(- 12884901883), |id_#res|=5] [?] RET #26#return; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#t~ret0|=5] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#res|=6] [?] assume true; VAL [id_~x=(- 12884901882), |id_#in~x|=(- 12884901882), |id_#res|=6] [?] RET #26#return; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#t~ret0|=6] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#res|=7] [?] assume true; VAL [id_~x=(- 12884901881), |id_#in~x|=(- 12884901881), |id_#res|=7] [?] RET #26#return; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#t~ret0|=7] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#res|=8] [?] assume true; VAL [id_~x=(- 12884901880), |id_#in~x|=(- 12884901880), |id_#res|=8] [?] RET #26#return; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#t~ret0|=8] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#res|=9] [?] assume true; VAL [id_~x=(- 12884901879), |id_#in~x|=(- 12884901879), |id_#res|=9] [?] RET #26#return; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#t~ret0|=9] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#res|=10] [?] assume true; VAL [id_~x=(- 12884901878), |id_#in~x|=(- 12884901878), |id_#res|=10] [?] RET #24#return; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), |ULTIMATE.start_main_#t~ret2|=10] [?] main_~result~0 := main_#t~ret2;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] assume 10 == main_~result~0 % 4294967296; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=(- 12884901878), ULTIMATE.start_main_~result~0=10] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L4-L7] ensures true; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L4-L7] ensures true; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L4-L7] ensures true; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L4-L7] ensures true; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L4-L7] ensures true; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L4-L7] ensures true; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L4-L7] ensures true; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L4-L7] ensures true; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L4-L7] ensures true; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L4-L7] ensures true; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L4-L7] ensures true; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12-L14] assume 10 == main_~result~0 % 4294967296; VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L4-L7] ensures true; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L4-L7] ensures true; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L4-L7] ensures true; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L4-L7] ensures true; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L4-L7] ensures true; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L4-L7] ensures true; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L4-L7] ensures true; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L4-L7] ensures true; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L4-L7] ensures true; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L4-L7] ensures true; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L4-L7] ensures true; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12-L14] assume 10 == main_~result~0 % 4294967296; VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12] COND TRUE 10 == main_~result~0 % 4294967296 VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0; [L10] main_~input~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] CALL call main_#t~ret2 := id(main_~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=10, main_~input~0=-12884901878] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=-12884901878, main_~result~0=10] [L12] COND TRUE 10 == main_~result~0 % 4294967296 VAL [main_~input~0=-12884901878, main_~result~0=10] [L13] assert false; VAL [main_~input~0=-12884901878, main_~result~0=10] [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 10 == ~result~0 % 4294967296 [L13] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=-12884901878] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901878, ~x=-12884901878] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901878, ~x=-12884901878] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901879, ~x=-12884901879] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901879, ~x=-12884901879] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901880, ~x=-12884901880] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901880, ~x=-12884901880] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901881, ~x=-12884901881] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901881, ~x=-12884901881] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901882, ~x=-12884901882] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901882, ~x=-12884901882] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901883, ~x=-12884901883] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901883, ~x=-12884901883] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901884, ~x=-12884901884] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901884, ~x=-12884901884] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901885, ~x=-12884901885] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901885, ~x=-12884901885] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901886, ~x=-12884901886] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901886, ~x=-12884901886] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901887, ~x=-12884901887] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=-12884901887, ~x=-12884901887] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901888] [L4-L7] ~x := #in~x; VAL [#in~x=-12884901888, ~x=-12884901888] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=-12884901888, #res=0, ~x=-12884901888] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901887, #t~ret0=0, ~x=-12884901887] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901887, #res=1, ~x=-12884901887] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901886, #t~ret0=1, ~x=-12884901886] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901886, #res=2, ~x=-12884901886] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901885, #t~ret0=2, ~x=-12884901885] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901885, #res=3, ~x=-12884901885] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901884, #t~ret0=3, ~x=-12884901884] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901884, #res=4, ~x=-12884901884] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901883, #t~ret0=4, ~x=-12884901883] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901883, #res=5, ~x=-12884901883] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901882, #t~ret0=5, ~x=-12884901882] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901882, #res=6, ~x=-12884901882] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901881, #t~ret0=6, ~x=-12884901881] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901881, #res=7, ~x=-12884901881] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901880, #t~ret0=7, ~x=-12884901880] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901880, #res=8, ~x=-12884901880] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901879, #t~ret0=8, ~x=-12884901879] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901879, #res=9, ~x=-12884901879] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=-12884901878, #t~ret0=9, ~x=-12884901878] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=-12884901878, #res=10, ~x=-12884901878] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 10 == ~result~0 % 4294967296 [L13] assert false; [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 [L13] __VERIFIER_error() ----- [2018-11-23 14:41:40,993 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9eb1ddb8-2d44-4c4b-891d-7c8c7a9b573f/bin-2019/ukojak/witness.graphml [2018-11-23 14:41:40,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:41:40,994 INFO L168 Benchmark]: Toolchain (without parser) took 7707.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 961.9 MB in the beginning and 941.4 MB in the end (delta: 20.5 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:40,996 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:40,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.53 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:40,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:40,997 INFO L168 Benchmark]: Boogie Preprocessor took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:40,998 INFO L168 Benchmark]: RCFGBuilder took 206.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:40,998 INFO L168 Benchmark]: CodeCheck took 7177.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 948.4 MB in the end (delta: 177.3 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:40,999 INFO L168 Benchmark]: Witness Printer took 109.20 ms. Allocated memory is still 1.2 GB. Free memory was 948.4 MB in the beginning and 941.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:41,002 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, 15 locations, 1 error locations. UNSAFE Result, 7.0s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7168 SDtfs, 3068 SDslu, 5112 SDs, 0 SdLazy, 26584 SolverSat, 13292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2080 GetRequests, 1806 SyntacticMatches, 126 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7585 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 62248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/900 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: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 10 [L13] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.53 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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 21.93 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 206.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 7177.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 948.4 MB in the end (delta: 177.3 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. * Witness Printer took 109.20 ms. Allocated memory is still 1.2 GB. Free memory was 948.4 MB in the beginning and 941.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...