./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19c675897a6506757b73d61913c0ceb3a779b5c8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:28:50,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:28:50,621 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:28:50,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:28:50,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:28:50,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:28:50,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:28:50,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:28:50,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:28:50,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:28:50,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:28:50,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:28:50,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:28:50,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:28:50,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:28:50,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:28:50,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:28:50,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:28:50,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:28:50,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:28:50,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:28:50,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:28:50,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:28:50,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:28:50,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:28:50,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:28:50,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:28:50,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:28:50,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:28:50,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:28:50,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:28:50,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:28:50,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:28:50,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:28:50,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:28:50,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:28:50,652 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:28:50,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:28:50,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:28:50,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:28:50,662 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:28:50,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:28:50,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:28:50,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:28:50,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:28:50,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:28:50,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:28:50,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:28:50,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:28:50,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:28:50,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:28:50,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:28:50,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:28:50,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:28:50,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:28:50,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:28:50,666 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_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19c675897a6506757b73d61913c0ceb3a779b5c8 [2018-11-23 15:28:50,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:28:50,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:28:50,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:28:50,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:28:50,702 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:28:50,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-23 15:28:50,747 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/data/0aee20547/41ce5508e92249fba715b785feb87b8c/FLAG7b2cdba16 [2018-11-23 15:28:51,073 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:28:51,074 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/sv-benchmarks/c/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-23 15:28:51,077 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/data/0aee20547/41ce5508e92249fba715b785feb87b8c/FLAG7b2cdba16 [2018-11-23 15:28:51,505 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/data/0aee20547/41ce5508e92249fba715b785feb87b8c [2018-11-23 15:28:51,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:28:51,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:28:51,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:28:51,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:28:51,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:28:51,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fe7c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51, skipping insertion in model container [2018-11-23 15:28:51,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:28:51,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:28:51,636 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:28:51,642 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:28:51,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:28:51,662 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:28:51,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51 WrapperNode [2018-11-23 15:28:51,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:28:51,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:28:51,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:28:51,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:28:51,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:28:51,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:28:51,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:28:51,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:28:51,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... [2018-11-23 15:28:51,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:28:51,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:28:51,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:28:51,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:28:51,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:28:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:28:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:28:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:28:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:28:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2018-11-23 15:28:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2018-11-23 15:28:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:28:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:28:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:28:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:28:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 15:28:51,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 15:28:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:28:51,909 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:28:51,909 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:28:51,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:51 BoogieIcfgContainer [2018-11-23 15:28:51,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:28:51,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:28:51,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:28:51,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:28:51,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:28:51" (1/3) ... [2018-11-23 15:28:51,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df6b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:51, skipping insertion in model container [2018-11-23 15:28:51,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:51" (2/3) ... [2018-11-23 15:28:51,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df6b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:51, skipping insertion in model container [2018-11-23 15:28:51,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:51" (3/3) ... [2018-11-23 15:28:51,915 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-23 15:28:51,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:28:51,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:28:51,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:28:51,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:28:51,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:28:51,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:28:51,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:28:51,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:28:51,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:28:51,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:28:51,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:28:51,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:28:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 15:28:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:28:51,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:28:51,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:28:51,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:28:51,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:28:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1626450083, now seen corresponding path program 1 times [2018-11-23 15:28:51,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:28:51,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:28:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:28:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:28:52,213 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 15:28:52,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:28:52,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:28:52,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:28:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:28:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:28:52,226 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2018-11-23 15:28:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:28:52,403 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 15:28:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:28:52,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 15:28:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:28:52,410 INFO L225 Difference]: With dead ends: 55 [2018-11-23 15:28:52,410 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 15:28:52,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:28:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 15:28:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 15:28:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:28:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 15:28:52,435 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2018-11-23 15:28:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:28:52,436 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 15:28:52,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:28:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 15:28:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:28:52,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:28:52,437 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:28:52,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:28:52,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:28:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash -519824651, now seen corresponding path program 1 times [2018-11-23 15:28:52,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:28:52,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:28:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:28:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:28:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:28:52,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:28:52,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:28:52,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:28:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:28:52,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:28:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:28:52,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:28:52,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-23 15:28:52,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:28:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:28:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:28:52,734 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2018-11-23 15:28:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:28:52,882 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 15:28:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:28:52,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 15:28:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:28:52,884 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:28:52,885 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 15:28:52,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:28:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 15:28:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 15:28:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 15:28:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 15:28:52,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2018-11-23 15:28:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:28:52,889 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 15:28:52,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:28:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 15:28:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 15:28:52,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:28:52,890 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:28:52,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:28:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:28:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2027370867, now seen corresponding path program 2 times [2018-11-23 15:28:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:28:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:28:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:28:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:28:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:28:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:28:52,936 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET #41#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [main_~bound~0.base=10, main_~bound~0.offset=28, |#NULL.base|=0, |#NULL.offset|=0, |main_~#pathbuf~0.base|=10, |main_~#pathbuf~0.offset|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] RET #39#return; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] RET #39#return; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=8, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=8, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L29] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8); [L31] ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; [L33] ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~#pathbuf~0.base=10, ~#pathbuf~0.offset=0, ~bound~0.base=10, ~bound~0.offset=28, ~tmp~0.base=10, ~tmp~0.offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L14-L25] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; [L14-L25] ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; [L16] havoc ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L29] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8); [L31] ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; [L33] ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~#pathbuf~0.base=10, ~#pathbuf~0.offset=0, ~bound~0.base=10, ~bound~0.offset=28, ~tmp~0.base=10, ~tmp~0.offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L14-L25] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; [L14-L25] ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; [L16] havoc ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L12] Char *tmp; VAL [\old(tmp)=13, \old(tmp)=11, tmp={0:0}] [L29] Char pathbuf[1 +1]; [L31] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L33] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={10:28}, pathbuf={10:0}, tmp={10:4}] [L35] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={10:0}, pathlim={10:28}, tmp={10:4}] [L16] Char *p; [L18] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] ----- [2018-11-23 15:28:52,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:28:52 BoogieIcfgContainer [2018-11-23 15:28:52,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:28:52,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:28:52,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:28:52,990 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:28:52,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:51" (3/4) ... [2018-11-23 15:28:52,993 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~tmp~0.base)|=13, |old(~tmp~0.offset)|=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET #41#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [main_~bound~0.base=10, main_~bound~0.offset=28, |#NULL.base|=0, |#NULL.offset|=0, |main_~#pathbuf~0.base|=10, |main_~#pathbuf~0.offset|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] RET #39#return; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] RET #39#return; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=4, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=8, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [glob2_~pathbuf.base=10, glob2_~pathbuf.offset=0, glob2_~pathlim.base=10, glob2_~pathlim.offset=28, glob2_~p~0.base=10, glob2_~p~0.offset=8, |#NULL.base|=0, |#NULL.offset|=0, |glob2_#in~pathbuf.base|=10, |glob2_#in~pathbuf.offset|=0, |glob2_#in~pathlim.base|=10, |glob2_#in~pathlim.offset|=28, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~tmp~0.base)|=0, |old(~tmp~0.offset)|=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L29] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8); [L31] ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; [L33] ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~#pathbuf~0.base=10, ~#pathbuf~0.offset=0, ~bound~0.base=10, ~bound~0.offset=28, ~tmp~0.base=10, ~tmp~0.offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L14-L25] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; [L14-L25] ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; [L16] havoc ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=13, ~tmp~0.offset=11] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~tmp~0.base, ~tmp~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~tmp~0.base)=13, old(~tmp~0.offset)=11, ~tmp~0.base=0, ~tmp~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~tmp~0.base=0, ~tmp~0.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=0, ~tmp~0.offset=0] [L29] call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8); [L31] ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4; [L33] ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; VAL [#NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~#pathbuf~0.base=10, ~#pathbuf~0.offset=0, ~bound~0.base=10, ~bound~0.offset=28, ~tmp~0.base=10, ~tmp~0.offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L14-L25] ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; [L14-L25] ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; [L16] havoc ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=1, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] RET call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L21] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=4, ~tmp~0.base=10, ~tmp~0.offset=4] [L18] #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; [L18] ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; [L18] havoc #t~post0.base, #t~post0.offset; VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L18-L22] assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); VAL [#in~pathbuf.base=10, #in~pathbuf.offset=0, #in~pathlim.base=10, #in~pathlim.offset=28, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~pathbuf.base=10, ~pathbuf.offset=0, ~pathlim.base=10, ~pathlim.offset=28, ~p~0.base=10, ~p~0.offset=8, ~tmp~0.base=10, ~tmp~0.offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~tmp~0.base)=0, old(~tmp~0.offset)=0, ~cond=0, ~tmp~0.base=10, ~tmp~0.offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=13, ~tmp~0!offset=11] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~tmp~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~tmp~0!base)=13, old(~tmp~0!offset)=11, ~tmp~0!base=0, ~tmp~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~tmp~0!base=0, ~tmp~0!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=0, ~tmp~0!offset=0] [L29] FCALL call ~#pathbuf~0 := #Ultimate.alloc(8); [L31] ~bound~0 := { base: ~#pathbuf~0!base, offset: 32 + ~#pathbuf~0!offset - 4 }; [L33] ~tmp~0 := { base: ~#pathbuf~0!base, offset: 8 + ~#pathbuf~0!offset - 4 }; VAL [#NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~#pathbuf~0!base=10, ~#pathbuf~0!offset=0, ~bound~0!base=10, ~bound~0!offset=28, ~tmp~0!base=10, ~tmp~0!offset=4] [L35] CALL call #t~ret1 := glob2(~#pathbuf~0, ~bound~0); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L14-L25] ~pathbuf := #in~pathbuf; [L14-L25] ~pathlim := #in~pathlim; [L16] havoc ~p~0; [L18] ~p~0 := ~pathbuf; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=1, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] RET call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L21] FCALL call write~int(1, ~p~0, 4); VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=4, ~tmp~0!base=10, ~tmp~0!offset=4] [L18] #t~post0 := ~p~0; [L18] ~p~0 := { base: #t~post0!base, offset: 4 + #t~post0!offset }; [L18] havoc #t~post0; VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L18-L22] COND FALSE !(!(~p~0!base == ~pathlim!base && ~p~0!offset <= ~pathlim!offset)) VAL [#in~pathbuf!base=10, #in~pathbuf!offset=0, #in~pathlim!base=10, #in~pathlim!offset=28, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~pathbuf!base=10, ~pathbuf!offset=0, ~pathlim!base=10, ~pathlim!offset=28, ~p~0!base=10, ~p~0!offset=8, ~tmp~0!base=10, ~tmp~0!offset=4] [L20] CALL call __VERIFIER_assert((if ~p~0!base == ~tmp~0!base && ~p~0!offset <= ~tmp~0!offset then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~tmp~0!base)=0, old(~tmp~0!offset)=0, ~cond=0, ~tmp~0!base=10, ~tmp~0!offset=4] [L12] Char *tmp; VAL [\old(tmp)=11, \old(tmp)=13, tmp={0:0}] [L29] Char pathbuf[1 +1]; [L31] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L33] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={10:28}, pathbuf={10:0}, tmp={10:4}] [L35] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={10:0}, pathlim={10:28}, tmp={10:4}] [L16] Char *p; [L18] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] ----- [2018-11-23 15:28:53,075 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6c84407-85c4-477f-abb2-a6edb30f72f2/bin-2019/uautomizer/witness.graphml [2018-11-23 15:28:53,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:28:53,076 INFO L168 Benchmark]: Toolchain (without parser) took 1568.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 959.1 MB in the beginning and 954.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,077 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:28:53,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,078 INFO L168 Benchmark]: Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:28:53,079 INFO L168 Benchmark]: RCFGBuilder took 205.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,079 INFO L168 Benchmark]: TraceAbstraction took 1079.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,080 INFO L168 Benchmark]: Witness Printer took 85.60 ms. Allocated memory is still 1.1 GB. Free memory was 959.6 MB in the beginning and 954.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:53,082 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.65 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1079.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.6 MB in the end (delta: 118.3 MB). Peak memory consumption was 118.3 MB. Max. memory is 11.5 GB. * Witness Printer took 85.60 ms. Allocated memory is still 1.1 GB. Free memory was 959.6 MB in the beginning and 954.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] Char *tmp; VAL [\old(tmp)=13, \old(tmp)=11, tmp={0:0}] [L29] Char pathbuf[1 +1]; [L31] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L33] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={10:28}, pathbuf={10:0}, tmp={10:4}] [L35] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={10:0}, pathlim={10:28}, tmp={10:4}] [L16] Char *p; [L18] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 47 SDslu, 140 SDs, 0 SdLazy, 175 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 4528 SizeOfPredicates, 8 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...