./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_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan --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 Taipan --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_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan --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 Taipan --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 11:53:02,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:53:02,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:53:02,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:53:02,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:53:02,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:53:02,731 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:53:02,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:53:02,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:53:02,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:53:02,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:53:02,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:53:02,736 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:53:02,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:53:02,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:53:02,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:53:02,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:53:02,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:53:02,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:53:02,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:53:02,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:53:02,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:53:02,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:53:02,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:53:02,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:53:02,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:53:02,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:53:02,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:53:02,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:53:02,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:53:02,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:53:02,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:53:02,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:53:02,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:53:02,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:53:02,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:53:02,750 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 11:53:02,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:53:02,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:53:02,759 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:53:02,759 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:53:02,759 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 11:53:02,759 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 11:53:02,759 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 11:53:02,760 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 11:53:02,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:53:02,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:53:02,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:53:02,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:53:02,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:53:02,763 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 11:53:02,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:53:02,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:53:02,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:53:02,764 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan 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 -> Taipan 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 11:53:02,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:53:02,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:53:02,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:53:02,797 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:53:02,798 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:53:02,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:53:02,832 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/82ec0ed3a/fe6785a0e5ab4a628bbf62818ab146f9/FLAGf0cdec4cd [2018-11-23 11:53:03,227 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:53:03,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:53:03,231 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/82ec0ed3a/fe6785a0e5ab4a628bbf62818ab146f9/FLAGf0cdec4cd [2018-11-23 11:53:03,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/82ec0ed3a/fe6785a0e5ab4a628bbf62818ab146f9 [2018-11-23 11:53:03,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:53:03,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:53:03,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:03,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:53:03,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:53:03,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,249 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 11:53:03, skipping insertion in model container [2018-11-23 11:53:03,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:53:03,269 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:53:03,376 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:03,378 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:53:03,396 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:03,407 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:53:03,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03 WrapperNode [2018-11-23 11:53:03,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:03,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:03,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:53:03,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:53:03,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:03,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:53:03,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:53:03,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:53:03,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... [2018-11-23 11:53:03,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:53:03,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:53:03,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:53:03,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:53:03,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:53:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:53:03,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:53:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:53:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:53:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:53:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:53:03,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:53:03,690 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:53:03,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:03 BoogieIcfgContainer [2018-11-23 11:53:03,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:53:03,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:53:03,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:53:03,692 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:53:03,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:53:03" (1/3) ... [2018-11-23 11:53:03,693 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 11:53:03, skipping insertion in model container [2018-11-23 11:53:03,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:03" (2/3) ... [2018-11-23 11:53:03,694 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 11:53:03, skipping insertion in model container [2018-11-23 11:53:03,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:03" (3/3) ... [2018-11-23 11:53:03,695 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 11:53:03,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:53:03,710 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:53:03,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:53:03,753 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:53:03,753 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:53:03,753 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:53:03,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:53:03,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:53:03,753 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:53:03,754 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:53:03,754 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:53:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:53:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:53:03,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:03,773 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 11:53:03,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:03,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 11:53:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:03,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:03,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,869 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 11:53:03,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:03,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:53:03,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:53:03,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:53:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:53:03,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:53:03,884 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:53:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:03,898 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 11:53:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:53:03,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:53:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:03,904 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:53:03,904 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:53:03,907 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 11:53:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:53:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:53:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:53:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:53:03,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 11:53:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:03,931 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:53:03,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:53:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:53:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:53:03,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:03,931 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 11:53:03,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:03,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 11:53:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:03,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,978 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 11:53:03,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:03,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:53:03,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 11:53:03,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:53:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:53:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:53:03,980 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 11:53:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,030 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 11:53:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:53:04,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:53:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:04,033 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:53:04,033 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:53:04,034 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 11:53:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:53:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 11:53:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:53:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:53:04,040 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 11:53:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:04,041 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:53:04,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:53:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:53:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:53:04,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:04,042 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 11:53:04,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:04,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 11:53:04,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:04,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:04,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,094 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 11:53:04,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:53:04,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-23 11:53:04,096 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [23], [29], [31], [33], [37], [41], [46], [49], [55], [60], [63], [72], [79], [91], [95], [98], [100], [106], [107], [108], [110] [2018-11-23 11:53:04,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 11:53:04,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 11:53:04,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 11:53:04,299 INFO L272 AbstractInterpreter]: Visited 28 different actions 57 times. Merged at 12 different actions 22 times. Widened at 1 different actions 1 times. Performed 298 root evaluator evaluations with a maximum evaluation depth of 5. Performed 298 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 5 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-23 11:53:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 11:53:04,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:04,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:53:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:04,370 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 11:53:04,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:04,392 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 11:53:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:53:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 11:53:04,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:53:04,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:53:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:53:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:53:04,409 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 11:53:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,461 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 11:53:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:53:04,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:53:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:04,462 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:53:04,463 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:53:04,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 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 11:53:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:53:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 11:53:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:53:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 11:53:04,468 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2018-11-23 11:53:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 11:53:04,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:53:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 11:53:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:53:04,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:04,469 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 11:53:04,470 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:04,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1752396196, now seen corresponding path program 2 times [2018-11-23 11:53:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,537 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 11:53:04,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:53:04,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 11:53:04,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 11:53:04,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:04,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:04,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 11:53:04,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:53:04,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:04,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:04,575 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 11:53:04,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:04,603 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 11:53:04,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:53:04,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-23 11:53:04,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:53:04,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:53:04,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:53:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:04,620 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-11-23 11:53:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,684 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-23 11:53:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:53:04,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-23 11:53:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:04,685 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:53:04,685 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:53:04,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:53:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-23 11:53:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:53:04,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2018-11-23 11:53:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:04,689 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:53:04,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:53:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:53:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:53:04,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:04,691 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 11:53:04,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash -800948324, now seen corresponding path program 3 times [2018-11-23 11:53:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,733 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 11:53:04,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:53:04,734 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 11:53:04,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 11:53:04,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:04,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 11:53:04,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:04,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:04,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:04,770 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 11:53:04,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:04,819 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 11:53:04,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:53:04,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-23 11:53:04,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:53:04,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:53:04,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:53:04,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:04,844 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-23 11:53:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:04,902 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-23 11:53:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:53:04,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 11:53:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:04,903 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:53:04,904 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:53:04,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:53:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 11:53:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:53:04,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2018-11-23 11:53:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:04,909 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:53:04,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:53:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:53:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:53:04,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:04,910 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 11:53:04,911 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:04,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 4 times [2018-11-23 11:53:04,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:04,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:04,974 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 11:53:04,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 11:53:04,974 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 11:53:04,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 11:53:04,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:04,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:04,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:04,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 11:53:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:05,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:05,024 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 11:53:05,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:05,057 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 11:53:05,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:53:05,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2018-11-23 11:53:05,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 11:53:05,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:53:05,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:53:05,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:05,072 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 11:53:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,131 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-23 11:53:05,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:53:05,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:53:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:05,132 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:53:05,132 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:53:05,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:53:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 11:53:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:53:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 11:53:05,137 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2018-11-23 11:53:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:05,137 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 11:53:05,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:53:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:53:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:53:05,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:05,138 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 11:53:05,138 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:05,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash 349736732, now seen corresponding path program 5 times [2018-11-23 11:53:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 11:53:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 11:53:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:05,205 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_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan 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 -> Taipan 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 11:53:06,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:53:06,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:53:06,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:53:06,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:53:06,925 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:53:06,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:53:06,972 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/d27858fe7/5e43e819e7c541e78329d9d4e5f29a57/FLAG0a47cfea3 [2018-11-23 11:53:07,291 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:53:07,292 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-23 11:53:07,296 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/d27858fe7/5e43e819e7c541e78329d9d4e5f29a57/FLAG0a47cfea3 [2018-11-23 11:53:07,726 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/data/d27858fe7/5e43e819e7c541e78329d9d4e5f29a57 [2018-11-23 11:53:07,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:53:07,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:53:07,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:07,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:53:07,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:53:07,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5e0560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07, skipping insertion in model container [2018-11-23 11:53:07,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:53:07,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:53:07,889 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:07,892 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:53:07,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:53:07,929 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:53:07,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07 WrapperNode [2018-11-23 11:53:07,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:53:07,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:07,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:53:07,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:53:07,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:53:07,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:53:07,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:53:07,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:53:07,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... [2018-11-23 11:53:07,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:53:07,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:53:07,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:53:07,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:53:07,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:53:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:53:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:53:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:53:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:53:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:53:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:53:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:53:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:53:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:53:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:53:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:53:08,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:53:08,235 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:53:08,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:08 BoogieIcfgContainer [2018-11-23 11:53:08,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:53:08,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:53:08,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:53:08,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:53:08,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:53:07" (1/3) ... [2018-11-23 11:53:08,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df9e861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:53:08, skipping insertion in model container [2018-11-23 11:53:08,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:53:07" (2/3) ... [2018-11-23 11:53:08,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df9e861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:53:08, skipping insertion in model container [2018-11-23 11:53:08,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:53:08" (3/3) ... [2018-11-23 11:53:08,239 INFO L112 eAbstractionObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-23 11:53:08,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:53:08,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:53:08,258 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:53:08,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:53:08,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:53:08,277 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:53:08,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:53:08,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:53:08,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:53:08,277 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:53:08,277 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:53:08,277 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:53:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 11:53:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:53:08,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:08,291 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 11:53:08,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:08,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2018-11-23 11:53:08,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:08,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:08,365 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 11:53:08,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:53:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:53:08,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:53:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:53:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:53:08,386 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 11:53:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:08,400 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2018-11-23 11:53:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:53:08,401 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 11:53:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:08,408 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:53:08,408 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:53:08,411 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 11:53:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:53:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:53:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:53:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:53:08,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2018-11-23 11:53:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:08,437 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:53:08,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:53:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:53:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:53:08,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:08,439 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 11:53:08,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:08,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2018-11-23 11:53:08,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:08,440 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:08,510 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 11:53:08,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Stream closed [2018-11-23 11:53:08,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:08,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:53:08,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:53:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:53:08,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:53:08,514 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2018-11-23 11:53:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:08,592 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 11:53:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:53:08,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:53:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:08,596 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:53:08,597 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:53:08,598 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 11:53:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:53:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 11:53:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:53:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 11:53:08,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2018-11-23 11:53:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:08,605 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 11:53:08,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:53:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 11:53:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:53:08,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:08,606 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 11:53:08,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:08,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2018-11-23 11:53:08,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:08,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:08,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:08,701 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 11:53:08,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:08,754 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 11:53:08,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:08,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:08,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:08,795 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 11:53:08,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:08,807 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 11:53:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 11:53:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-11-23 11:53:08,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:53:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:53:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:53:08,823 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 6 states. [2018-11-23 11:53:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:08,992 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:53:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:53:08,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:53:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:08,994 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:53:08,994 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:53:08,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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 11:53:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:53:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-11-23 11:53:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 11:53:08,999 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2018-11-23 11:53:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:08,999 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 11:53:08,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:53:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:53:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:53:09,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:09,000 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 11:53:09,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:09,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 2 times [2018-11-23 11:53:09,001 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:09,001 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:09,013 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:09,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:53:09,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:09,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:09,095 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 11:53:09,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:53:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:09,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:53:09,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:53:09,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:53:09,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:53:09,102 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2018-11-23 11:53:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:09,247 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 11:53:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:53:09,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:53:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:09,248 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:53:09,248 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:53:09,249 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 11:53:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:53:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-23 11:53:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:53:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 11:53:09,253 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2018-11-23 11:53:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:09,253 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 11:53:09,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:53:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:53:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:53:09,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:09,254 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 11:53:09,254 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:09,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1489958921, now seen corresponding path program 1 times [2018-11-23 11:53:09,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:09,255 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:09,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:09,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:09,365 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 11:53:09,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:09,447 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 11:53:09,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:09,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:09,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:09,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:53:09,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 11:53:09,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 11:53:09,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 8] total 22 [2018-11-23 11:53:09,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:53:09,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:53:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:53:09,741 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 22 states. [2018-11-23 11:53:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:11,584 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2018-11-23 11:53:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 11:53:11,585 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 11:53:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:11,586 INFO L225 Difference]: With dead ends: 167 [2018-11-23 11:53:11,586 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 11:53:11,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=568, Invalid=3854, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 11:53:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 11:53:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 60. [2018-11-23 11:53:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:53:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-11-23 11:53:11,597 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 42 [2018-11-23 11:53:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:11,598 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-11-23 11:53:11,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:53:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-23 11:53:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:53:11,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:11,599 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 11:53:11,599 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:11,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1835345178, now seen corresponding path program 1 times [2018-11-23 11:53:11,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:11,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:11,683 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 11:53:11,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:53:11,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:53:11,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:53:11,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:53:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:53:11,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:53:11,686 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 4 states. [2018-11-23 11:53:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:11,730 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-23 11:53:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:53:11,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-23 11:53:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:11,731 INFO L225 Difference]: With dead ends: 79 [2018-11-23 11:53:11,731 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:53:11,731 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 11:53:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:53:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:53:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:53:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 11:53:11,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 48 [2018-11-23 11:53:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:11,738 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 11:53:11,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:53:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 11:53:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:53:11,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:11,739 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 11:53:11,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:11,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1547819580, now seen corresponding path program 1 times [2018-11-23 11:53:11,739 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/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 11:53:11,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:11,837 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 11:53:11,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:53:11,860 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 11:53:11,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:11,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:53:11,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:11,943 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 11:53:11,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:53:11,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:11,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 10 [2018-11-23 11:53:11,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:53:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:53:11,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:53:11,960 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 10 states. [2018-11-23 11:53:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:12,093 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-23 11:53:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:53:12,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-11-23 11:53:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:12,094 INFO L225 Difference]: With dead ends: 128 [2018-11-23 11:53:12,094 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:53:12,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:53:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:53:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 57. [2018-11-23 11:53:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:53:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-23 11:53:12,102 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 48 [2018-11-23 11:53:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:12,102 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 11:53:12,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:53:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 11:53:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:53:12,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:12,103 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 11:53:12,103 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:12,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash -915073569, now seen corresponding path program 1 times [2018-11-23 11:53:12,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:53:12,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da76e839-12b4-4140-af18-81055f00be0e/bin-2019/utaipan/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:53:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:53:12,414 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)<