./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/string_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_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 77cd31699320cd40da64f32a92959020d19291bd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 77cd31699320cd40da64f32a92959020d19291bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 09:58:16,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:17,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:17,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:17,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:17,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:17,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:17,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:17,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:17,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:17,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:17,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:17,013 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:17,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:17,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:17,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:17,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:17,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:17,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:17,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:17,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:17,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:17,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:17,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:17,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:17,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:17,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:17,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:17,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:17,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:17,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:17,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:17,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:17,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:17,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:17,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:17,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:58:17,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:17,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:17,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:17,037 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:17,038 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:17,038 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:17,038 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:17,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:17,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:17,039 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:17,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:17,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:17,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:17,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:17,041 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:17,041 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:58:17,041 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:17,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:58:17,041 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_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 -> 77cd31699320cd40da64f32a92959020d19291bd [2018-11-23 09:58:17,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:17,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:17,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:17,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:17,078 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:17,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 09:58:17,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/6cdcf51cb/b895b3173dfd4601bb25d8a9140729c1/FLAG593d8199a [2018-11-23 09:58:17,523 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:17,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 09:58:17,527 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/6cdcf51cb/b895b3173dfd4601bb25d8a9140729c1/FLAG593d8199a [2018-11-23 09:58:17,535 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/6cdcf51cb/b895b3173dfd4601bb25d8a9140729c1 [2018-11-23 09:58:17,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:17,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:17,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:17,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:17,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:17,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17, skipping insertion in model container [2018-11-23 09:58:17,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:17,562 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:17,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:17,678 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:17,692 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:17,703 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:17,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17 WrapperNode [2018-11-23 09:58:17,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:17,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:17,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:17,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:17,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:17,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:17,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:17,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:17,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... [2018-11-23 09:58:17,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:17,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:17,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:17,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:17,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 09:58:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:58:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:58:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:18,038 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:18,038 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 09:58:18,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:18 BoogieIcfgContainer [2018-11-23 09:58:18,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:18,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:18,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:18,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:18,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:17" (1/3) ... [2018-11-23 09:58:18,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8e9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:18, skipping insertion in model container [2018-11-23 09:58:18,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:17" (2/3) ... [2018-11-23 09:58:18,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e8e9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:18, skipping insertion in model container [2018-11-23 09:58:18,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:18" (3/3) ... [2018-11-23 09:58:18,043 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 09:58:18,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:18,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:18,070 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:18,093 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:18,094 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:18,094 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:18,094 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:18,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:18,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:18,094 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:18,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:18,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 09:58:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 09:58:18,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 09:58:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:18,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,197 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 09:58:18,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:18,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:18,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:18,213 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 09:58:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:18,227 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 09:58:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:18,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 09:58:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:18,232 INFO L225 Difference]: With dead ends: 62 [2018-11-23 09:58:18,232 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:58:18,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:58:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:58:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:58:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 09:58:18,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 09:58:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 09:58:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 09:58:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 09:58:18,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 09:58:18,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,301 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 09:58:18,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:18,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:18,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:18,303 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 09:58:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:18,337 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 09:58:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:18,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 09:58:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:18,339 INFO L225 Difference]: With dead ends: 56 [2018-11-23 09:58:18,339 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:58:18,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:58:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 09:58:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 09:58:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 09:58:18,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 09:58:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:18,344 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 09:58:18,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 09:58:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:58:18,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,345 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 09:58:18,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:18,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:58:18,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 09:58:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 09:58:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:58:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:58:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:58:18,477 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 09:58:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:18,534 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 09:58:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:58:18,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 09:58:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:18,535 INFO L225 Difference]: With dead ends: 65 [2018-11-23 09:58:18,535 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 09:58:18,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:58:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 09:58:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 09:58:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 09:58:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 09:58:18,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2018-11-23 09:58:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:18,540 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 09:58:18,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:58:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 09:58:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:58:18,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,541 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1752396196, now seen corresponding path program 2 times [2018-11-23 09:58:18,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:58:18,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:58:18,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:58:18,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:18,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:18,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:18,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:58:18,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:18,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 09:58:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:18,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:18,668 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-11-23 09:58:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:18,724 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-23 09:58:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:58:18,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 09:58:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:18,726 INFO L225 Difference]: With dead ends: 75 [2018-11-23 09:58:18,726 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 09:58:18,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 09:58:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-23 09:58:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 09:58:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 09:58:18,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2018-11-23 09:58:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:18,731 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 09:58:18,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 09:58:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:58:18,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,732 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,732 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -800948324, now seen corresponding path program 3 times [2018-11-23 09:58:18,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:58:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 09:58:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:58:18,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:58:18,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:18,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 09:58:18,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:18,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 09:58:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 09:58:18,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 09:58:18,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 09:58:18,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:18,851 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-23 09:58:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:18,919 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-23 09:58:18,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:18,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 09:58:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:18,920 INFO L225 Difference]: With dead ends: 85 [2018-11-23 09:58:18,921 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 09:58:18,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 09:58:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 09:58:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:58:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 09:58:18,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2018-11-23 09:58:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:18,928 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 09:58:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 09:58:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 09:58:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 09:58:18,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:18,929 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:18,929 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 4 times [2018-11-23 09:58:18,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:18,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:58:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:58:18,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:58:18,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:58:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:19,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:19,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:19,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:58:19,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:19,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 09:58:19,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:58:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:58:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:58:19,056 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 09:58:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:19,142 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 09:58:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 09:58:19,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 09:58:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:19,143 INFO L225 Difference]: With dead ends: 93 [2018-11-23 09:58:19,143 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 09:58:19,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:58:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 09:58:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 09:58:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:58:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 09:58:19,156 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2018-11-23 09:58:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:19,156 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 09:58:19,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:58:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:58:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 09:58:19,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:19,157 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:19,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:19,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 349736732, now seen corresponding path program 5 times [2018-11-23 09:58:19,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:58:19,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:58:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:19,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:58:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:58:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:19,226 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #107#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret15 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < 5); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; VAL [main_~found~0=0, main_~i~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < 5); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [main_~found~0=0, main_~i~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(0 != #t~mem7);havoc #t~mem7; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] ~nc_B~0 := 0; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem9|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(0 != #t~mem9);havoc #t~mem9; VAL [main_~found~0=0, main_~i~0=5, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; VAL [main_~found~0=0, main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [main_~found~0=0, main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [main_~i~0=0, main_~j~0=0, main_~nc_A~0=0, main_~nc_B~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#string_A~0.base|=7, |main_~#string_A~0.offset|=0, |main_~#string_B~0.base|=10, |main_~#string_B~0.offset|=0] [?] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L21-L22] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] assume !!(0 == #t~mem3); [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L25-L26] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] assume !!(0 == #t~mem6); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] assume !(0 != #t~mem7); [L30] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] assume !(0 != #t~mem9); [L34] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] assume !!(~nc_B~0 >= ~nc_A~0); [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21-L22] assume !!(~i~0 < 5); [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1); [L22] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L21-L22] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L23] assume !!(0 == #t~mem3); [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25-L26] assume !!(~i~0 < 5); [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L25-L26] assume !(~i~0 < 5); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5] [L27] assume !!(0 == #t~mem6); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] assume !(0 != #t~mem7); [L30] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] assume !(0 != #t~mem9); [L34] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] assume !!(~nc_B~0 >= ~nc_A~0); [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#string_A~0.base=7, ~#string_A~0.offset=0, ~#string_B~0.base=10, ~#string_B~0.offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21-L22] COND FALSE !(!(~i~0 < 5)) [L22] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L22] FCALL call write~int(#t~nondet2, { base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~i~0 }, 1); [L22] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L21] #t~post1 := ~i~0; [L21] ~i~0 := 1 + #t~post1; [L21] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L21-L22] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] FCALL call #t~mem3 := read~int({ base: ~#string_A~0!base, offset: 4 + ~#string_A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L23] COND FALSE !(!(0 == #t~mem3)) [L23] havoc #t~mem3; [L25] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=1] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=2] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=3] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25-L26] COND FALSE !(!(~i~0 < 5)) [L26] assume -128 <= #t~nondet5 && #t~nondet5 <= 127; [L26] FCALL call write~int(#t~nondet5, { base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~i~0 }, 1); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=4] [L25] #t~post4 := ~i~0; [L25] ~i~0 := 1 + #t~post4; [L25] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L25-L26] COND TRUE !(~i~0 < 5) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] FCALL call #t~mem6 := read~int({ base: ~#string_B~0!base, offset: 4 + ~#string_B~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5] [L27] COND FALSE !(!(0 == #t~mem6)) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30] FCALL call #t~mem7 := read~int({ base: ~#string_A~0!base, offset: ~#string_A~0!offset + ~nc_A~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L30-L31] COND TRUE !(0 != #t~mem7) [L30] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0] [L33] ~nc_B~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34] FCALL call #t~mem9 := read~int({ base: ~#string_B~0!base, offset: ~#string_B~0!offset + ~nc_B~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L34-L35] COND TRUE !(0 != #t~mem9) [L34] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=5, ~nc_A~0=0, ~nc_B~0=0] [L37] COND FALSE !(!(~nc_B~0 >= ~nc_A~0)) [L40] ~j~0 := 0; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L41-L53] COND TRUE !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0) VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~found~0=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L55] ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); VAL [#NULL!base=0, #NULL!offset=0, ~#string_A~0!base=7, ~#string_A~0!offset=0, ~#string_B~0!base=10, ~#string_B~0!offset=0, ~i~0=0, ~j~0=0, ~nc_A~0=0, ~nc_B~0=0] [L57] CALL call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=1, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=2, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=3, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=4, string_A={7:0}, string_B={10:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L21] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L23] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={10:0}] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=1, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=2, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=3, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=4, string_A={7:0}, string_B={10:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L25] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={10:0}] [L27] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={7:0}, string_B={10:0}, string_B[5 -1]=0] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_B={10:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={10:0}] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}, string_B[nc_B]=0] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L41] COND FALSE !((inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={10:0}] [L41] COND FALSE !((inc_B-1)< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 -> 77cd31699320cd40da64f32a92959020d19291bd [2018-11-23 09:58:20,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:20,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:20,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:20,834 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:20,834 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:20,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 09:58:20,877 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/f79553f24/f7ea34096db04752b402955fcb628227/FLAGf0e1f41a2 [2018-11-23 09:58:21,276 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:21,277 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 09:58:21,280 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/f79553f24/f7ea34096db04752b402955fcb628227/FLAGf0e1f41a2 [2018-11-23 09:58:21,288 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/data/f79553f24/f7ea34096db04752b402955fcb628227 [2018-11-23 09:58:21,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:21,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:21,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:21,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:21,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:21,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619db95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21, skipping insertion in model container [2018-11-23 09:58:21,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:21,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:21,456 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:21,460 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:21,479 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:21,492 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:21,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21 WrapperNode [2018-11-23 09:58:21,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:21,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:21,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:21,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:21,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:21,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:21,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:21,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:21,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... [2018-11-23 09:58:21,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:21,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:21,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:21,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:21,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/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 09:58:21,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:21,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 09:58:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:21,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:21,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:21,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:21,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 09:58:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:21,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:21,795 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 09:58:21,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:21 BoogieIcfgContainer [2018-11-23 09:58:21,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:21,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:21,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:21,798 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:21,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:21" (1/3) ... [2018-11-23 09:58:21,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:21, skipping insertion in model container [2018-11-23 09:58:21,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:21" (2/3) ... [2018-11-23 09:58:21,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440e710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:21, skipping insertion in model container [2018-11-23 09:58:21,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:21" (3/3) ... [2018-11-23 09:58:21,800 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 09:58:21,808 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:21,814 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:21,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:21,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:21,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:21,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:21,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:21,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:21,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:21,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:21,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:21,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 09:58:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 09:58:21,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:21,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:21,864 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:21,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 09:58:21,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:21,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:21,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:21,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:21,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:21,955 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 09:58:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:21,972 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 09:58:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:21,974 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 09:58:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:21,980 INFO L225 Difference]: With dead ends: 62 [2018-11-23 09:58:21,980 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:58:21,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:58:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:58:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:58:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 09:58:22,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 09:58:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:22,007 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 09:58:22,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 09:58:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 09:58:22,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:22,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:22,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:22,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 09:58:22,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:22,009 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:22,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:22,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:22,083 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 09:58:22,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:22,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:22,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:22,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:22,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:22,087 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 09:58:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:22,164 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 09:58:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:22,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 09:58:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:22,167 INFO L225 Difference]: With dead ends: 56 [2018-11-23 09:58:22,168 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:58:22,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:58:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 09:58:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 09:58:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 09:58:22,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 09:58:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:22,176 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 09:58:22,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 09:58:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:58:22,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:22,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:22,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:22,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 09:58:22,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:22,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:22,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:22,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:22,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:22,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:22,301 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2018-11-23 09:58:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:22,475 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 09:58:22,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:22,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 09:58:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:22,476 INFO L225 Difference]: With dead ends: 79 [2018-11-23 09:58:22,477 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 09:58:22,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 09:58:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-11-23 09:58:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:58:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 09:58:22,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2018-11-23 09:58:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:22,482 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 09:58:22,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 09:58:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 09:58:22,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:22,483 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:22,483 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:22,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 2 times [2018-11-23 09:58:22,484 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:22,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:22,497 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:22,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:58:22,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:22,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 09:58:22,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:22,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:22,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 09:58:22,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:58:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:58:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:58:22,584 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 09:58:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:22,732 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 09:58:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 09:58:22,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 09:58:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:22,734 INFO L225 Difference]: With dead ends: 68 [2018-11-23 09:58:22,734 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 09:58:22,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 09:58:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 09:58:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-23 09:58:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 09:58:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 09:58:22,738 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2018-11-23 09:58:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:22,739 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 09:58:22,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:58:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 09:58:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 09:58:22,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:22,740 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:22,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:22,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1489958921, now seen corresponding path program 1 times [2018-11-23 09:58:22,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:22,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:58:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:22,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 09:58:22,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 09:58:22,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:22,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:22,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:22,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:22,919 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 12 states. [2018-11-23 09:58:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:23,225 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2018-11-23 09:58:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 09:58:23,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 09:58:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:23,228 INFO L225 Difference]: With dead ends: 105 [2018-11-23 09:58:23,228 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 09:58:23,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 09:58:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-11-23 09:58:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 09:58:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-23 09:58:23,235 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2018-11-23 09:58:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:23,235 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-23 09:58:23,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 09:58:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 09:58:23,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:23,237 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:23,237 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:23,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1777563849, now seen corresponding path program 2 times [2018-11-23 09:58:23,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:23,256 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:23,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:58:23,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:23,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 09:58:23,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:23,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 09:58:23,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:23,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:23,336 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2018-11-23 09:58:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:23,442 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-23 09:58:23,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:23,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 09:58:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:23,443 INFO L225 Difference]: With dead ends: 59 [2018-11-23 09:58:23,443 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 09:58:23,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:58:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 09:58:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 09:58:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 09:58:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 09:58:23,449 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 46 [2018-11-23 09:58:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:23,450 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 09:58:23,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 09:58:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 09:58:23,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:23,452 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:23,453 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:23,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1835345178, now seen corresponding path program 1 times [2018-11-23 09:58:23,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:23,453 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:23,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:58:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:23,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 09:58:23,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:23,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:23,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:58:23,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:58:23,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:58:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:58:23,537 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 4 states. [2018-11-23 09:58:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:23,570 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-23 09:58:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:58:23,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-23 09:58:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:23,571 INFO L225 Difference]: With dead ends: 64 [2018-11-23 09:58:23,572 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 09:58:23,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:58:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 09:58:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 09:58:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 09:58:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 09:58:23,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 48 [2018-11-23 09:58:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:23,577 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 09:58:23,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:58:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 09:58:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 09:58:23,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:23,578 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:23,578 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:23,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1547819580, now seen corresponding path program 1 times [2018-11-23 09:58:23,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:23,579 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 09:58:23,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 09:58:23,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 09:58:23,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:58:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:58:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:58:23,695 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-11-23 09:58:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:23,797 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2018-11-23 09:58:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 09:58:23,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 09:58:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:23,798 INFO L225 Difference]: With dead ends: 100 [2018-11-23 09:58:23,798 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 09:58:23,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-23 09:58:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 09:58:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-11-23 09:58:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 09:58:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-23 09:58:23,807 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 48 [2018-11-23 09:58:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:23,809 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-23 09:58:23,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:58:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 09:58:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 09:58:23,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:23,810 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:23,811 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:23,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -915073569, now seen corresponding path program 1 times [2018-11-23 09:58:23,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:23,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4624fbe5-d7e5-43f8-b2a3-4986f62c894b/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:58:24,123 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #107#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret15 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0bv32;~i~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);havoc #t~nondet2; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !~bvslt32(~i~0, 5bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem3|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~i~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv3 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32);havoc #t~nondet5; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !~bvslt32(~i~0, 5bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem6|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6));havoc #t~mem6;~nc_A~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7;#t~post8 := ~nc_A~0;~nc_A~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7));havoc #t~mem7; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] ~nc_B~0 := 0bv32; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv0 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9));havoc #t~mem9; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv5 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!~bvsge32(~nc_B~0, ~nc_A~0);~j~0 := 0bv32;~i~0 := ~j~0; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv0 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0));call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32);call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv0 32), main_~j~0=(_ bv0 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem11|=(_ bv1 8), |main_#t~mem12|=(_ bv1 8), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12);havoc #t~mem11;havoc #t~mem12;#t~post13 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post13);havoc #t~post13;#t~post14 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [main_~found~0=(_ bv0 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [main_~found~0=(_ bv2 32), main_~i~0=(_ bv1 32), main_~j~0=(_ bv1 32), main_~nc_A~0=(_ bv1 32), main_~nc_B~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#string_A~0.base|=(_ bv3 32), |main_~#string_A~0.offset|=(_ bv0 32), |main_~#string_B~0.base|=(_ bv2 32), |main_~#string_B~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3)); [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6)); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] assume !!~bvsge32(~nc_B~0, ~nc_A~0); [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); [L43] call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L43] call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43-L52] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12); [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L17] call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.alloc(5bv32); [L17] call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] assume !!~bvslt32(~i~0, 5bv32); [L22] call write~intINTTYPE1(#t~nondet2, ~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L22] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] call #t~mem3 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(4bv32, ~#string_A~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3)); [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] assume !!~bvslt32(~i~0, 5bv32); [L26] call write~intINTTYPE1(#t~nondet5, ~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~i~0), 1bv32); [L26] havoc #t~nondet5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] assume !~bvslt32(~i~0, 5bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] call #t~mem6 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(4bv32, ~#string_B~0.offset), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem6)); [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] call #t~mem7 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~nc_A~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem7=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem7)); [L30] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] call #t~mem9 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~nc_B~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem9=0bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] assume !(0bv32 != ~sign_extendFrom8To32(#t~mem9)); [L34] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] assume !!~bvsge32(~nc_B~0, ~nc_A~0); [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); [L43] call #t~mem11 := read~intINTTYPE1(~#string_A~0.base, ~bvadd32(~#string_A~0.offset, ~i~0), 1bv32); [L43] call #t~mem12 := read~intINTTYPE1(~#string_B~0.base, ~bvadd32(~#string_B~0.offset, ~j~0), 1bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43-L52] assume ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12); [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] assume !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#string_A~0.base=3bv32, ~#string_A~0.offset=0bv32, ~#string_B~0.base=2bv32, ~#string_B~0.offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L17] FCALL call ~#string_A~0 := #Ultimate.alloc(5bv32); [L17] FCALL call ~#string_B~0 := #Ultimate.alloc(5bv32); [L18] havoc ~i~0; [L18] havoc ~j~0; [L18] havoc ~nc_A~0; [L18] havoc ~nc_B~0; [L18] ~found~0 := 0bv32; [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21-L22] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L22] FCALL call write~intINTTYPE1(#t~nondet2, { base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L22] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L21] #t~post1 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post1); [L21] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L21-L22] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] FCALL call #t~mem3 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(4bv32, ~#string_A~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L23] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem3))) [L23] havoc #t~mem3; [L25] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=2bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=3bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25-L26] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L26] FCALL call write~intINTTYPE1(#t~nondet5, { base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~i~0) }, 1bv32); [L26] havoc #t~nondet5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=4bv32] [L25] #t~post4 := ~i~0; [L25] ~i~0 := ~bvadd32(1bv32, #t~post4); [L25] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L25-L26] COND TRUE !~bvslt32(~i~0, 5bv32) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] FCALL call #t~mem6 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(4bv32, ~#string_B~0!offset) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32] [L27] COND FALSE !(!(0bv32 == ~sign_extendFrom8To32(#t~mem6))) [L27] havoc #t~mem6; [L29] ~nc_A~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=0bv32] [L30-L31] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem7))) [L30] havoc #t~mem7; [L31] #t~post8 := ~nc_A~0; [L31] ~nc_A~0 := ~bvadd32(1bv32, #t~post8); [L31] havoc #t~post8; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30] FCALL call #t~mem7 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~nc_A~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem7=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L30-L31] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem7)) [L30] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32] [L33] ~nc_B~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=0bv32] [L34-L35] COND FALSE !(!(0bv32 != ~sign_extendFrom8To32(#t~mem9))) [L34] havoc #t~mem9; [L35] #t~post10 := ~nc_B~0; [L35] ~nc_B~0 := ~bvadd32(1bv32, #t~post10); [L35] havoc #t~post10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34] FCALL call #t~mem9 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~nc_B~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem9=0bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L34-L35] COND TRUE !(0bv32 != ~sign_extendFrom8To32(#t~mem9)) [L34] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=5bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L37] COND FALSE !(!~bvsge32(~nc_B~0, ~nc_A~0)) [L40] ~j~0 := 0bv32; [L40] ~i~0 := ~j~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND FALSE !(!(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0))) [L43] FCALL call #t~mem11 := read~intINTTYPE1({ base: ~#string_A~0!base, offset: ~bvadd32(~#string_A~0!offset, ~i~0) }, 1bv32); [L43] FCALL call #t~mem12 := read~intINTTYPE1({ base: ~#string_B~0!base, offset: ~bvadd32(~#string_B~0!offset, ~j~0) }, 1bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem11=1bv8, #t~mem12=1bv8, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=0bv32, ~j~0=0bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L43] COND TRUE ~sign_extendFrom8To32(#t~mem11) == ~sign_extendFrom8To32(#t~mem12) [L43] havoc #t~mem11; [L43] havoc #t~mem12; [L45] #t~post13 := ~i~0; [L45] ~i~0 := ~bvadd32(1bv32, #t~post13); [L45] havoc #t~post13; [L46] #t~post14 := ~j~0; [L46] ~j~0 := ~bvadd32(1bv32, #t~post14); [L46] havoc #t~post14; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L41-L53] COND TRUE !(~bvslt32(~i~0, ~nc_A~0) && ~bvslt32(~j~0, ~nc_B~0)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=0bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L55] ~found~0 := ~bvshl32((if ~bvsgt32(~j~0, ~bvsub32(~nc_B~0, 1bv32)) then 1bv32 else 0bv32), ~i~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#string_A~0!base=3bv32, ~#string_A~0!offset=0bv32, ~#string_B~0!base=2bv32, ~#string_B~0!offset=0bv32, ~found~0=2bv32, ~i~0=1bv32, ~j~0=1bv32, ~nc_A~0=1bv32, ~nc_B~0=1bv32] [L57] CALL call __VERIFIER_assert((if 0bv32 == ~found~0 || 1bv32 == ~found~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=1, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=2, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=3, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=4, string_A={3:0}, string_B={2:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L21] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L23] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={3:0}, string_A[5 -1]=0, string_B={2:0}] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=1, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=2, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=3, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=4, string_A={3:0}, string_B={2:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L25] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={2:0}] [L27] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={3:0}, string_B={2:0}, string_B[5 -1]=0] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_B={2:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_A[nc_A]=1, string_B={2:0}] [L30] COND TRUE string_A[nc_A]!='\0' [L31] nc_A++ VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_B={2:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_A[nc_A]=0, string_B={2:0}] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={2:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={2:0}, string_B[nc_B]=1] [L34] COND TRUE string_B[nc_B]!='\0' [L35] nc_B++ VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}, string_B[nc_B]=0] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={2:0}] [L41] COND TRUE (inc_B-1)<