./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o20_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_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 ......................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:52:40,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:52:40,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:52:40,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:52:40,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:52:40,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:52:40,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:52:40,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:52:40,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:52:40,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:52:40,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:52:40,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:52:40,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:52:40,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:52:40,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:52:40,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:52:40,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:52:40,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:52:40,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:52:40,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:52:40,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:52:40,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:52:40,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:52:40,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:52:40,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:52:40,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:52:40,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:52:40,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:52:40,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:52:40,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:52:40,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:52:40,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:52:40,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:52:40,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:52:40,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:52:40,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:52:40,228 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 06:52:40,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:52:40,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:52:40,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:52:40,239 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:52:40,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:52:40,239 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:52:40,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:52:40,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:52:40,241 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:52:40,241 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:52:40,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:52:40,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:52:40,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:52:40,242 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_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2018-11-23 06:52:40,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:52:40,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:52:40,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:52:40,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:52:40,275 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:52:40,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 06:52:40,310 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/a5da2cd28/38a620ebd1d24ed8bd603745d556cc8a/FLAGe8065808f [2018-11-23 06:52:40,692 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:52:40,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 06:52:40,696 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/a5da2cd28/38a620ebd1d24ed8bd603745d556cc8a/FLAGe8065808f [2018-11-23 06:52:40,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/a5da2cd28/38a620ebd1d24ed8bd603745d556cc8a [2018-11-23 06:52:40,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:52:40,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:52:40,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:52:40,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:52:40,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:52:40,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f370fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40, skipping insertion in model container [2018-11-23 06:52:40,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:52:40,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:52:40,837 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:52:40,840 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:52:40,848 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:52:40,857 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:52:40,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40 WrapperNode [2018-11-23 06:52:40,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:52:40,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:52:40,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:52:40,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:52:40,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:52:40,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:52:40,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:52:40,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:52:40,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... [2018-11-23 06:52:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:52:40,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:52:40,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:52:40,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:52:40,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 06:52:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:52:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:52:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 06:52:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 06:52:41,069 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:52:41,069 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 06:52:41,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:52:41 BoogieIcfgContainer [2018-11-23 06:52:41,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:52:41,070 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:52:41,070 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:52:41,080 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:52:41,080 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:52:41" (1/1) ... [2018-11-23 06:52:41,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:52:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 06:52:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 06:52:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 06:52:41,128 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:41,310 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 06:52:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 18 states and 21 transitions. [2018-11-23 06:52:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 06:52:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:52:41,398 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:41,509 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 06:52:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 23 states and 27 transitions. [2018-11-23 06:52:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 06:52:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 06:52:41,718 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:41,834 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 06:52:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2018-11-23 06:52:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 06:52:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 06:52:42,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:42,259 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 06:52:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 33 states and 39 transitions. [2018-11-23 06:52:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 06:52:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:52:42,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:42,729 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 06:52:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2018-11-23 06:52:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 06:52:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:52:43,120 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:43,299 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 06:52:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 43 states and 51 transitions. [2018-11-23 06:52:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 06:52:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 06:52:43,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:43,932 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 06:52:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2018-11-23 06:52:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 06:52:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 06:52:44,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:44,659 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 06:52:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 53 states and 63 transitions. [2018-11-23 06:52:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-23 06:52:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 06:52:45,266 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:45,509 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 06:52:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 58 states and 69 transitions. [2018-11-23 06:52:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 06:52:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 06:52:46,283 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:46,553 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 06:52:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 63 states and 75 transitions. [2018-11-23 06:52:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-23 06:52:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 06:52:47,358 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 06:52:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 68 states and 81 transitions. [2018-11-23 06:52:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-23 06:52:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 06:52:48,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 06:52:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 73 states and 87 transitions. [2018-11-23 06:52:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2018-11-23 06:52:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 06:52:50,214 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 06:52:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 78 states and 93 transitions. [2018-11-23 06:52:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-11-23 06:52:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 06:52:51,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 06:52:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 83 states and 99 transitions. [2018-11-23 06:52:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-23 06:52:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 06:52:53,528 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 06:52:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 88 states and 105 transitions. [2018-11-23 06:52:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-11-23 06:52:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 06:52:55,264 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 06:52:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 93 states and 111 transitions. [2018-11-23 06:52:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-11-23 06:52:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 06:52:57,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 06:52:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:52:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 98 states and 117 transitions. [2018-11-23 06:52:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-23 06:52:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 06:52:59,376 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:52:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:52:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 06:53:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 103 states and 123 transitions. [2018-11-23 06:53:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-11-23 06:53:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 06:53:01,785 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 06:53:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 108 states and 129 transitions. [2018-11-23 06:53:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-11-23 06:53:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 06:53:04,640 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 06:53:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 113 states and 135 transitions. [2018-11-23 06:53:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-11-23 06:53:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 06:53:08,059 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 06:53:18,367 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: Solver said unknown at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:505) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 06:53:18,370 INFO L168 Benchmark]: Toolchain (without parser) took 37661.58 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 558.9 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 371.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:18,371 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:53:18,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:18,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.68 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:18,372 INFO L168 Benchmark]: Boogie Preprocessor took 9.84 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:53:18,372 INFO L168 Benchmark]: RCFGBuilder took 183.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:18,373 INFO L168 Benchmark]: CodeCheck took 37298.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.3 MB). Peak memory consumption was 400.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:18,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: Solver said unknown de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: Solver said unknown: de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:505) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 18.68 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.84 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 183.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 37298.87 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.3 MB). Peak memory consumption was 400.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 06:53:19,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:53:19,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:53:19,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:53:19,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:53:19,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:53:19,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:53:19,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:53:19,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:53:19,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:53:19,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:53:19,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:53:19,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:53:19,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:53:19,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:53:19,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:53:19,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:53:19,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:53:19,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:53:19,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:53:19,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:53:19,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:53:19,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:53:19,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:53:19,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:53:19,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:53:19,805 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:53:19,806 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:53:19,807 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:53:19,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:53:19,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:53:19,808 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:53:19,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:53:19,809 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:53:19,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:53:19,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:53:19,810 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 06:53:19,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:53:19,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:53:19,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:53:19,821 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:53:19,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:53:19,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:53:19,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:53:19,822 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:53:19,822 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:53:19,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:53:19,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:53:19,823 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:53:19,824 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:53:19,824 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:53:19,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:53:19,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:53:19,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:53:19,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:53:19,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:53:19,825 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:53:19,825 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_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2018-11-23 06:53:19,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:53:19,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:53:19,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:53:19,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:53:19,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:53:19,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 06:53:19,905 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/64f5cc2cb/780182ffd1fc49a1bfbfd90602b8e048/FLAG6fcf464f2 [2018-11-23 06:53:20,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:53:20,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 06:53:20,223 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/64f5cc2cb/780182ffd1fc49a1bfbfd90602b8e048/FLAG6fcf464f2 [2018-11-23 06:53:20,664 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/data/64f5cc2cb/780182ffd1fc49a1bfbfd90602b8e048 [2018-11-23 06:53:20,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:53:20,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:53:20,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:53:20,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:53:20,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:53:20,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713512cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20, skipping insertion in model container [2018-11-23 06:53:20,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:53:20,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:53:20,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:53:20,826 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:53:20,835 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:53:20,844 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:53:20,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20 WrapperNode [2018-11-23 06:53:20,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:53:20,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:53:20,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:53:20,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:53:20,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:53:20,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:53:20,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:53:20,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:53:20,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... [2018-11-23 06:53:20,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:53:20,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:53:20,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:53:20,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:53:20,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:53:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/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 06:53:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:53:20,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:53:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 06:53:20,958 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 06:53:21,051 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:53:21,051 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 06:53:21,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:21 BoogieIcfgContainer [2018-11-23 06:53:21,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:53:21,052 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:53:21,052 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:53:21,059 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:53:21,059 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:21" (1/1) ... [2018-11-23 06:53:21,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:53:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 06:53:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 06:53:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 06:53:21,092 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:21,125 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:21,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:21,189 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 06:53:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 18 states and 21 transitions. [2018-11-23 06:53:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 06:53:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:53:21,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:21,257 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:21,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:21,374 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 06:53:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 23 states and 27 transitions. [2018-11-23 06:53:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 06:53:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 06:53:21,584 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:21,585 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:21,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:21,665 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 06:53:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 28 states and 33 transitions. [2018-11-23 06:53:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 06:53:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 06:53:21,945 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:21,945 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:21,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:22,054 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 06:53:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 33 states and 39 transitions. [2018-11-23 06:53:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 06:53:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 06:53:22,403 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:22,404 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:22,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:22,549 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 06:53:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 38 states and 45 transitions. [2018-11-23 06:53:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 06:53:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 06:53:22,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:22,957 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:22,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:23,137 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 06:53:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 43 states and 51 transitions. [2018-11-23 06:53:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 06:53:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 06:53:23,611 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:23,612 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:23,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:23,807 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 06:53:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 48 states and 57 transitions. [2018-11-23 06:53:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 06:53:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 06:53:24,405 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:24,406 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:24,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:24,724 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 06:53:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 53 states and 63 transitions. [2018-11-23 06:53:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-23 06:53:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 06:53:25,377 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:25,377 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:25,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:25,723 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 06:53:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 58 states and 69 transitions. [2018-11-23 06:53:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 06:53:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 06:53:26,631 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:26,632 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:26,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:26,949 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 06:53:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 63 states and 75 transitions. [2018-11-23 06:53:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-11-23 06:53:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 06:53:27,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:27,965 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:27,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 06:53:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 68 states and 81 transitions. [2018-11-23 06:53:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-23 06:53:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 06:53:29,411 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:29,412 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:29,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 06:53:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 73 states and 87 transitions. [2018-11-23 06:53:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2018-11-23 06:53:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 06:53:31,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:31,064 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:31,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-23 06:53:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 78 states and 93 transitions. [2018-11-23 06:53:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-11-23 06:53:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 06:53:32,865 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:32,866 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:32,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 06:53:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 83 states and 99 transitions. [2018-11-23 06:53:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-23 06:53:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 06:53:34,892 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:34,893 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:34,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-23 06:53:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 88 states and 105 transitions. [2018-11-23 06:53:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2018-11-23 06:53:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 06:53:37,085 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:37,086 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:37,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 06:53:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 93 states and 111 transitions. [2018-11-23 06:53:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2018-11-23 06:53:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 06:53:39,485 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:39,486 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:39,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-23 06:53:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 98 states and 117 transitions. [2018-11-23 06:53:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-23 06:53:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 06:53:42,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:42,311 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:42,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-23 06:53:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 103 states and 123 transitions. [2018-11-23 06:53:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-11-23 06:53:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 06:53:45,267 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:45,267 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:45,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 06:53:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 108 states and 129 transitions. [2018-11-23 06:53:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2018-11-23 06:53:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 06:53:48,507 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:48,507 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:53:48,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:53:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 06:53:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:53:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 113 states and 135 transitions. [2018-11-23 06:53:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-11-23 06:53:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 06:53:52,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:53:52,135 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:53:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:53:52,212 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 21 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|=#x00000014] [?] ~x := #in~x; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000014, |id_#in~x|=#x00000014] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000013] [?] ~x := #in~x; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000013, |id_#in~x|=#x00000013] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000012] [?] ~x := #in~x; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000012, |id_#in~x|=#x00000012] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000011] [?] ~x := #in~x; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000011, |id_#in~x|=#x00000011] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000010] [?] ~x := #in~x; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000010, |id_#in~x|=#x00000010] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000f] [?] ~x := #in~x; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000e] [?] ~x := #in~x; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000d] [?] ~x := #in~x; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000c] [?] ~x := #in~x; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000b] [?] ~x := #in~x; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000a] [?] ~x := #in~x; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000009] [?] ~x := #in~x; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000009, |id_#in~x|=#x00000009] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000008] [?] ~x := #in~x; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000008, |id_#in~x|=#x00000008] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000007] [?] ~x := #in~x; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000007, |id_#in~x|=#x00000007] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000006] [?] ~x := #in~x; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000006, |id_#in~x|=#x00000006] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000005] [?] ~x := #in~x; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000005, |id_#in~x|=#x00000005] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000004] [?] ~x := #in~x; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000004, |id_#in~x|=#x00000004] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000003] [?] ~x := #in~x; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000003, |id_#in~x|=#x00000003] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000002] [?] ~x := #in~x; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000002, |id_#in~x|=#x00000002] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000001] [?] ~x := #in~x; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000001, |id_#in~x|=#x00000001] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000000] [?] ~x := #in~x; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000] [?] assume 0bv32 == ~x;#res := 0bv32; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000, |id_#res|=#x00000000] [?] assume true; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000, |id_#res|=#x00000000] [?] RET #26#return; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#t~ret0|=#x00000000] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#res|=#x00000001] [?] assume true; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#res|=#x00000001] [?] RET #26#return; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#t~ret0|=#x00000001] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#res|=#x00000002] [?] assume true; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#res|=#x00000002] [?] RET #26#return; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#t~ret0|=#x00000002] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#res|=#x00000003] [?] assume true; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#res|=#x00000003] [?] RET #26#return; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#t~ret0|=#x00000003] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#res|=#x00000004] [?] assume true; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#res|=#x00000004] [?] RET #26#return; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#t~ret0|=#x00000004] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#res|=#x00000005] [?] assume true; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#res|=#x00000005] [?] RET #26#return; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#t~ret0|=#x00000005] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#res|=#x00000006] [?] assume true; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#res|=#x00000006] [?] RET #26#return; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#t~ret0|=#x00000006] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#res|=#x00000007] [?] assume true; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#res|=#x00000007] [?] RET #26#return; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#t~ret0|=#x00000007] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#res|=#x00000008] [?] assume true; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#res|=#x00000008] [?] RET #26#return; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#t~ret0|=#x00000008] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#res|=#x00000009] [?] assume true; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#res|=#x00000009] [?] RET #26#return; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#t~ret0|=#x00000009] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#res|=#x0000000a] [?] assume true; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#res|=#x0000000a] [?] RET #26#return; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#t~ret0|=#x0000000a] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#res|=#x0000000b] [?] assume true; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#res|=#x0000000b] [?] RET #26#return; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#t~ret0|=#x0000000b] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#res|=#x0000000c] [?] assume true; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#res|=#x0000000c] [?] RET #26#return; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#t~ret0|=#x0000000c] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#res|=#x0000000d] [?] assume true; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#res|=#x0000000d] [?] RET #26#return; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#t~ret0|=#x0000000d] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#res|=#x0000000e] [?] assume true; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#res|=#x0000000e] [?] RET #26#return; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#t~ret0|=#x0000000e] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#res|=#x0000000f] [?] assume true; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#res|=#x0000000f] [?] RET #26#return; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#t~ret0|=#x0000000f] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#res|=#x00000010] [?] assume true; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#res|=#x00000010] [?] RET #26#return; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#t~ret0|=#x00000010] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#res|=#x00000011] [?] assume true; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#res|=#x00000011] [?] RET #26#return; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#t~ret0|=#x00000011] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#res|=#x00000012] [?] assume true; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#res|=#x00000012] [?] RET #26#return; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#t~ret0|=#x00000012] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#res|=#x00000013] [?] assume true; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#res|=#x00000013] [?] RET #26#return; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#t~ret0|=#x00000013] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#res|=#x00000014] [?] assume true; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#res|=#x00000014] [?] RET #24#return; VAL [ULTIMATE.start_main_~input~0=#x00000014, |ULTIMATE.start_main_#t~ret2|=#x00000014] [?] main_~result~0 := main_#t~ret2;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] assume 20bv32 == main_~result~0; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] assume 0bv32 == ~x; [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L4-L7] ensures true; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L4-L7] ensures true; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L4-L7] ensures true; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L4-L7] ensures true; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L4-L7] ensures true; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L4-L7] ensures true; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L4-L7] ensures true; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L4-L7] ensures true; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L4-L7] ensures true; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L4-L7] ensures true; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L4-L7] ensures true; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L4-L7] ensures true; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L4-L7] ensures true; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L4-L7] ensures true; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L4-L7] ensures true; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L4-L7] ensures true; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L4-L7] ensures true; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L4-L7] ensures true; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L4-L7] ensures true; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L4-L7] ensures true; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L4-L7] ensures true; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12-L14] assume 20bv32 == main_~result~0; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] ----- ----- 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] assume 0bv32 == ~x; [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L4-L7] ensures true; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L4-L7] ensures true; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L4-L7] ensures true; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L4-L7] ensures true; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L4-L7] ensures true; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L4-L7] ensures true; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L4-L7] ensures true; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L4-L7] ensures true; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L4-L7] ensures true; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L4-L7] ensures true; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L4-L7] ensures true; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L4-L7] ensures true; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L4-L7] ensures true; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L4-L7] ensures true; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L4-L7] ensures true; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L4-L7] ensures true; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L4-L7] ensures true; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L4-L7] ensures true; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L4-L7] ensures true; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L4-L7] ensures true; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L4-L7] ensures true; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12-L14] assume 20bv32 == main_~result~0; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [?] 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12] COND TRUE 20bv32 == main_~result~0 VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] ----- ----- 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12] COND TRUE 20bv32 == main_~result~0 VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 20bv32 == ~result~0 [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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 20bv32 == ~result~0 [L13] assert false; [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() ----- [2018-11-23 06:53:52,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 06:53:52 ImpRootNode [2018-11-23 06:53:52,309 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 06:53:52,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:53:52,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:53:52,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:53:52,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:53:21" (3/4) ... [2018-11-23 06:53:52,312 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|=#x00000014] [?] ~x := #in~x; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000014, |id_#in~x|=#x00000014] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000013] [?] ~x := #in~x; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000013, |id_#in~x|=#x00000013] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000012] [?] ~x := #in~x; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000012, |id_#in~x|=#x00000012] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000011] [?] ~x := #in~x; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000011, |id_#in~x|=#x00000011] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000010] [?] ~x := #in~x; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000010, |id_#in~x|=#x00000010] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000f] [?] ~x := #in~x; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000e] [?] ~x := #in~x; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000d] [?] ~x := #in~x; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000c] [?] ~x := #in~x; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000b] [?] ~x := #in~x; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x0000000a] [?] ~x := #in~x; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a] [?] assume !(0bv32 == ~x); VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000009] [?] ~x := #in~x; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000009, |id_#in~x|=#x00000009] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000008] [?] ~x := #in~x; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000008, |id_#in~x|=#x00000008] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000007] [?] ~x := #in~x; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000007, |id_#in~x|=#x00000007] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000006] [?] ~x := #in~x; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000006, |id_#in~x|=#x00000006] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000005] [?] ~x := #in~x; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000005, |id_#in~x|=#x00000005] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000004] [?] ~x := #in~x; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000004, |id_#in~x|=#x00000004] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000003] [?] ~x := #in~x; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000003, |id_#in~x|=#x00000003] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000002] [?] ~x := #in~x; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000002, |id_#in~x|=#x00000002] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000001] [?] ~x := #in~x; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001] [?] assume !(0bv32 == ~x); VAL [id_~x=#x00000001, |id_#in~x|=#x00000001] [?] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [|id_#in~x|=#x00000000] [?] ~x := #in~x; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000] [?] assume 0bv32 == ~x;#res := 0bv32; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000, |id_#res|=#x00000000] [?] assume true; VAL [id_~x=#x00000000, |id_#in~x|=#x00000000, |id_#res|=#x00000000] [?] RET #26#return; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#t~ret0|=#x00000000] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#res|=#x00000001] [?] assume true; VAL [id_~x=#x00000001, |id_#in~x|=#x00000001, |id_#res|=#x00000001] [?] RET #26#return; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#t~ret0|=#x00000001] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#res|=#x00000002] [?] assume true; VAL [id_~x=#x00000002, |id_#in~x|=#x00000002, |id_#res|=#x00000002] [?] RET #26#return; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#t~ret0|=#x00000002] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#res|=#x00000003] [?] assume true; VAL [id_~x=#x00000003, |id_#in~x|=#x00000003, |id_#res|=#x00000003] [?] RET #26#return; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#t~ret0|=#x00000003] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#res|=#x00000004] [?] assume true; VAL [id_~x=#x00000004, |id_#in~x|=#x00000004, |id_#res|=#x00000004] [?] RET #26#return; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#t~ret0|=#x00000004] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#res|=#x00000005] [?] assume true; VAL [id_~x=#x00000005, |id_#in~x|=#x00000005, |id_#res|=#x00000005] [?] RET #26#return; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#t~ret0|=#x00000005] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#res|=#x00000006] [?] assume true; VAL [id_~x=#x00000006, |id_#in~x|=#x00000006, |id_#res|=#x00000006] [?] RET #26#return; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#t~ret0|=#x00000006] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#res|=#x00000007] [?] assume true; VAL [id_~x=#x00000007, |id_#in~x|=#x00000007, |id_#res|=#x00000007] [?] RET #26#return; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#t~ret0|=#x00000007] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#res|=#x00000008] [?] assume true; VAL [id_~x=#x00000008, |id_#in~x|=#x00000008, |id_#res|=#x00000008] [?] RET #26#return; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#t~ret0|=#x00000008] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#res|=#x00000009] [?] assume true; VAL [id_~x=#x00000009, |id_#in~x|=#x00000009, |id_#res|=#x00000009] [?] RET #26#return; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#t~ret0|=#x00000009] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#res|=#x0000000a] [?] assume true; VAL [id_~x=#x0000000a, |id_#in~x|=#x0000000a, |id_#res|=#x0000000a] [?] RET #26#return; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#t~ret0|=#x0000000a] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#res|=#x0000000b] [?] assume true; VAL [id_~x=#x0000000b, |id_#in~x|=#x0000000b, |id_#res|=#x0000000b] [?] RET #26#return; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#t~ret0|=#x0000000b] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#res|=#x0000000c] [?] assume true; VAL [id_~x=#x0000000c, |id_#in~x|=#x0000000c, |id_#res|=#x0000000c] [?] RET #26#return; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#t~ret0|=#x0000000c] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#res|=#x0000000d] [?] assume true; VAL [id_~x=#x0000000d, |id_#in~x|=#x0000000d, |id_#res|=#x0000000d] [?] RET #26#return; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#t~ret0|=#x0000000d] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#res|=#x0000000e] [?] assume true; VAL [id_~x=#x0000000e, |id_#in~x|=#x0000000e, |id_#res|=#x0000000e] [?] RET #26#return; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#t~ret0|=#x0000000e] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#res|=#x0000000f] [?] assume true; VAL [id_~x=#x0000000f, |id_#in~x|=#x0000000f, |id_#res|=#x0000000f] [?] RET #26#return; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#t~ret0|=#x0000000f] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#res|=#x00000010] [?] assume true; VAL [id_~x=#x00000010, |id_#in~x|=#x00000010, |id_#res|=#x00000010] [?] RET #26#return; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#t~ret0|=#x00000010] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#res|=#x00000011] [?] assume true; VAL [id_~x=#x00000011, |id_#in~x|=#x00000011, |id_#res|=#x00000011] [?] RET #26#return; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#t~ret0|=#x00000011] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#res|=#x00000012] [?] assume true; VAL [id_~x=#x00000012, |id_#in~x|=#x00000012, |id_#res|=#x00000012] [?] RET #26#return; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#t~ret0|=#x00000012] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#res|=#x00000013] [?] assume true; VAL [id_~x=#x00000013, |id_#in~x|=#x00000013, |id_#res|=#x00000013] [?] RET #26#return; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#t~ret0|=#x00000013] [?] #res := ~bvadd32(1bv32, #t~ret0);havoc #t~ret0; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#res|=#x00000014] [?] assume true; VAL [id_~x=#x00000014, |id_#in~x|=#x00000014, |id_#res|=#x00000014] [?] RET #24#return; VAL [ULTIMATE.start_main_~input~0=#x00000014, |ULTIMATE.start_main_#t~ret2|=#x00000014] [?] main_~result~0 := main_#t~ret2;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] assume 20bv32 == main_~result~0; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] assume !false; VAL [ULTIMATE.start_main_~input~0=#x00000014, ULTIMATE.start_main_~result~0=#x00000014] [?] 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] assume 0bv32 == ~x; [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L4-L7] ensures true; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L4-L7] ensures true; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L4-L7] ensures true; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L4-L7] ensures true; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L4-L7] ensures true; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L4-L7] ensures true; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L4-L7] ensures true; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L4-L7] ensures true; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L4-L7] ensures true; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L4-L7] ensures true; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L4-L7] ensures true; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L4-L7] ensures true; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L4-L7] ensures true; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L4-L7] ensures true; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L4-L7] ensures true; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L4-L7] ensures true; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L4-L7] ensures true; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L4-L7] ensures true; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L4-L7] ensures true; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L4-L7] ensures true; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L4-L7] ensures true; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12-L14] assume 20bv32 == main_~result~0; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] ----- ----- 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] assume !(0bv32 == ~x); VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] assume 0bv32 == ~x; [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L4-L7] ensures true; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L4-L7] ensures true; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L4-L7] ensures true; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L4-L7] ensures true; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L4-L7] ensures true; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L4-L7] ensures true; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L4-L7] ensures true; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L4-L7] ensures true; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L4-L7] ensures true; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L4-L7] ensures true; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L4-L7] ensures true; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L4-L7] ensures true; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L4-L7] ensures true; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L4-L7] ensures true; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L4-L7] ensures true; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L4-L7] ensures true; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L4-L7] ensures true; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L4-L7] ensures true; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L4-L7] ensures true; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L4-L7] ensures true; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L4-L7] ensures true; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12-L14] assume 20bv32 == main_~result~0; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [?] 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12] COND TRUE 20bv32 == main_~result~0 VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] ----- ----- 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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call main_#t~ret2 := id(main_~input~0); VAL [main_#t~ret2=20bv32, main_~input~0=20bv32] [L11] main_~result~0 := main_#t~ret2; [L11] havoc main_#t~ret2; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L12] COND TRUE 20bv32 == main_~result~0 VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L13] assert false; VAL [main_~input~0=20bv32, main_~result~0=20bv32] [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 20bv32 == ~result~0 [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=20bv32] [L4-L7] ~x := #in~x; VAL [#in~x=20bv32, ~x=20bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=20bv32, ~x=20bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32] [L4-L7] ~x := #in~x; VAL [#in~x=19bv32, ~x=19bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=19bv32, ~x=19bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32] [L4-L7] ~x := #in~x; VAL [#in~x=18bv32, ~x=18bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=18bv32, ~x=18bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32] [L4-L7] ~x := #in~x; VAL [#in~x=17bv32, ~x=17bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=17bv32, ~x=17bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32] [L4-L7] ~x := #in~x; VAL [#in~x=16bv32, ~x=16bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=16bv32, ~x=16bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32] [L4-L7] ~x := #in~x; VAL [#in~x=15bv32, ~x=15bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=15bv32, ~x=15bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32] [L4-L7] ~x := #in~x; VAL [#in~x=14bv32, ~x=14bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=14bv32, ~x=14bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32] [L4-L7] ~x := #in~x; VAL [#in~x=13bv32, ~x=13bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=13bv32, ~x=13bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32] [L4-L7] ~x := #in~x; VAL [#in~x=12bv32, ~x=12bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=12bv32, ~x=12bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32] [L4-L7] ~x := #in~x; VAL [#in~x=11bv32, ~x=11bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=11bv32, ~x=11bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32] [L4-L7] ~x := #in~x; VAL [#in~x=10bv32, ~x=10bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=10bv32, ~x=10bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32] [L4-L7] ~x := #in~x; VAL [#in~x=9bv32, ~x=9bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=9bv32, ~x=9bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32] [L4-L7] ~x := #in~x; VAL [#in~x=8bv32, ~x=8bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=8bv32, ~x=8bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32] [L4-L7] ~x := #in~x; VAL [#in~x=7bv32, ~x=7bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=7bv32, ~x=7bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32] [L4-L7] ~x := #in~x; VAL [#in~x=6bv32, ~x=6bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=6bv32, ~x=6bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32] [L4-L7] ~x := #in~x; VAL [#in~x=5bv32, ~x=5bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=5bv32, ~x=5bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32] [L4-L7] ~x := #in~x; VAL [#in~x=4bv32, ~x=4bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=4bv32, ~x=4bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32] [L4-L7] ~x := #in~x; VAL [#in~x=3bv32, ~x=3bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=3bv32, ~x=3bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32] [L4-L7] ~x := #in~x; VAL [#in~x=2bv32, ~x=2bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=2bv32, ~x=2bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32] [L4-L7] ~x := #in~x; VAL [#in~x=1bv32, ~x=1bv32] [L5] COND FALSE !(0bv32 == ~x) VAL [#in~x=1bv32, ~x=1bv32] [L6] CALL call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=0bv32] [L4-L7] ~x := #in~x; VAL [#in~x=0bv32, ~x=0bv32] [L5] COND TRUE 0bv32 == ~x [L5] #res := 0bv32; VAL [#in~x=0bv32, #res=0bv32, ~x=0bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=1bv32, #t~ret0=0bv32, ~x=1bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=1bv32, #res=1bv32, ~x=1bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=2bv32, #t~ret0=1bv32, ~x=2bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=2bv32, #res=2bv32, ~x=2bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=3bv32, #t~ret0=2bv32, ~x=3bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=3bv32, #res=3bv32, ~x=3bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=4bv32, #t~ret0=3bv32, ~x=4bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=4bv32, #res=4bv32, ~x=4bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=5bv32, #t~ret0=4bv32, ~x=5bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=5bv32, #res=5bv32, ~x=5bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=6bv32, #t~ret0=5bv32, ~x=6bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=6bv32, #res=6bv32, ~x=6bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=7bv32, #t~ret0=6bv32, ~x=7bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=7bv32, #res=7bv32, ~x=7bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=8bv32, #t~ret0=7bv32, ~x=8bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=8bv32, #res=8bv32, ~x=8bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=9bv32, #t~ret0=8bv32, ~x=9bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=9bv32, #res=9bv32, ~x=9bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=10bv32, #t~ret0=9bv32, ~x=10bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=10bv32, #res=10bv32, ~x=10bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=11bv32, #t~ret0=10bv32, ~x=11bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=11bv32, #res=11bv32, ~x=11bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=12bv32, #t~ret0=11bv32, ~x=12bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=12bv32, #res=12bv32, ~x=12bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=13bv32, #t~ret0=12bv32, ~x=13bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=13bv32, #res=13bv32, ~x=13bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=14bv32, #t~ret0=13bv32, ~x=14bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=14bv32, #res=14bv32, ~x=14bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=15bv32, #t~ret0=14bv32, ~x=15bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=15bv32, #res=15bv32, ~x=15bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=16bv32, #t~ret0=15bv32, ~x=16bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=16bv32, #res=16bv32, ~x=16bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=17bv32, #t~ret0=16bv32, ~x=17bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=17bv32, #res=17bv32, ~x=17bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=18bv32, #t~ret0=17bv32, ~x=18bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=18bv32, #res=18bv32, ~x=18bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=19bv32, #t~ret0=18bv32, ~x=19bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=19bv32, #res=19bv32, ~x=19bv32] [L6] RET call #t~ret0 := id(~bvsub32(~x, 1bv32)); VAL [#in~x=20bv32, #t~ret0=19bv32, ~x=20bv32] [L6] #res := ~bvadd32(1bv32, #t~ret0); [L6] havoc #t~ret0; VAL [#in~x=20bv32, #res=20bv32, ~x=20bv32] [L11] RET call #t~ret2 := id(~input~0); [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; [L12] COND TRUE 20bv32 == ~result~0 [L13] assert false; [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() ----- [2018-11-23 06:53:52,617 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f13e0da5-8ab6-4549-a5d8-4d152c56543c/bin-2019/ukojak/witness.graphml [2018-11-23 06:53:52,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:53:52,618 INFO L168 Benchmark]: Toolchain (without parser) took 31950.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.7 MB). Free memory was 949.7 MB in the beginning and 976.3 MB in the end (delta: -26.5 MB). Peak memory consumption was 463.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,619 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:53:52,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.78 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,620 INFO L168 Benchmark]: Boogie Preprocessor took 11.51 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:53:52,620 INFO L168 Benchmark]: RCFGBuilder took 176.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,622 INFO L168 Benchmark]: CodeCheck took 31256.68 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 127.0 MB). Peak memory consumption was 499.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,623 INFO L168 Benchmark]: Witness Printer took 307.81 ms. Allocated memory is still 1.5 GB. Free memory was 976.4 MB in the beginning and 976.3 MB in the end (delta: 95.3 kB). Peak memory consumption was 95.3 kB. Max. memory is 11.5 GB. [2018-11-23 06:53:52,625 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, 31.1s OverallTime, 21 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7340032 SDtfs, 3145724 SDslu, 5242872 SDs, 0 SdLazy, 27262936 SolverSat, 13631468 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7895 GetRequests, 7529 SyntacticMatches, 58 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43768 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1300 ConstructedInterpolants, 0 QuantifiedInterpolants, 266864 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1800 ConjunctsInSsa, 460 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/7600 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)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 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 18.78 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 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.51 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * CodeCheck took 31256.68 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 127.0 MB). Peak memory consumption was 499.2 MB. Max. memory is 11.5 GB. * Witness Printer took 307.81 ms. Allocated memory is still 1.5 GB. Free memory was 976.4 MB in the beginning and 976.3 MB in the end (delta: 95.3 kB). Peak memory consumption was 95.3 kB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...