./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/invert_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_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:16:28,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:16:28,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:16:28,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:16:28,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:16:28,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:16:28,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:16:28,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:16:28,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:16:28,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:16:28,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:16:28,973 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:16:28,973 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:16:28,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:16:28,975 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:16:28,976 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:16:28,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:16:28,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:16:28,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:16:28,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:16:28,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:16:28,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:16:28,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:16:28,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:16:28,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:16:28,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:16:28,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:16:28,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:16:28,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:16:28,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:16:28,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:16:28,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:16:28,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:16:28,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:16:28,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:16:28,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:16:28,989 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:16:28,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:16:28,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:16:28,998 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:16:28,999 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:16:28,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:16:28,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:16:28,999 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:16:28,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:16:29,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:16:29,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:16:29,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:16:29,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:16:29,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-11-23 03:16:29,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:16:29,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:16:29,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:16:29,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:16:29,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:16:29,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 03:16:29,071 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/data/68d6d3776/bdaa39dc4d3f433fa7f059b413587189/FLAGbab928877 [2018-11-23 03:16:29,476 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:16:29,477 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-23 03:16:29,480 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/data/68d6d3776/bdaa39dc4d3f433fa7f059b413587189/FLAGbab928877 [2018-11-23 03:16:29,489 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/data/68d6d3776/bdaa39dc4d3f433fa7f059b413587189 [2018-11-23 03:16:29,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:16:29,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:16:29,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:16:29,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:16:29,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:16:29,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6043f292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29, skipping insertion in model container [2018-11-23 03:16:29,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:16:29,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:16:29,662 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:16:29,664 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:16:29,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:16:29,690 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:16:29,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29 WrapperNode [2018-11-23 03:16:29,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:16:29,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:16:29,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:16:29,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:16:29,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:16:29,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:16:29,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:16:29,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:16:29,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... [2018-11-23 03:16:29,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:16:29,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:16:29,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:16:29,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:16:29,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:16:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:16:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:16:29,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:16:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:16:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 03:16:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 03:16:29,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:16:29,919 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:16:29,919 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 03:16:29,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:29 BoogieIcfgContainer [2018-11-23 03:16:29,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:16:29,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:16:29,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:16:29,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:16:29,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:16:29" (1/3) ... [2018-11-23 03:16:29,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7609c26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:29, skipping insertion in model container [2018-11-23 03:16:29,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:29" (2/3) ... [2018-11-23 03:16:29,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7609c26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:29, skipping insertion in model container [2018-11-23 03:16:29,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:29" (3/3) ... [2018-11-23 03:16:29,925 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-23 03:16:29,932 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:16:29,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:16:29,945 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:16:29,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:16:29,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:16:29,964 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:16:29,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:16:29,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:16:29,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:16:29,965 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:16:29,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:16:29,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:16:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 03:16:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 03:16:29,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:29,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:29,982 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:29,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 03:16:29,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:30,075 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 03:16:30,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:16:30,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:16:30,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:16:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:16:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:16:30,088 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 03:16:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:30,100 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 03:16:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:16:30,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 03:16:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:30,106 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:16:30,106 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 03:16:30,108 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 03:16:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 03:16:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 03:16:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 03:16:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 03:16:30,130 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 03:16:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:30,131 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 03:16:30,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:16:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 03:16:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 03:16:30,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:30,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:30,132 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:30,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 03:16:30,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:30,203 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 03:16:30,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:16:30,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:16:30,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:16:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:16:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:16:30,205 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-23 03:16:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:30,261 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 03:16:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:16:30,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 03:16:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:30,262 INFO L225 Difference]: With dead ends: 36 [2018-11-23 03:16:30,262 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:16:30,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:16:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:16:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 03:16:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:16:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 03:16:30,268 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 03:16:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:30,268 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 03:16:30,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:16:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 03:16:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 03:16:30,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:30,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:30,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:30,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2018-11-23 03:16:30,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:30,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:16:30,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:16:30,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:16:30,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:16:30,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:16:30,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:16:30,331 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 03:16:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:30,415 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 03:16:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:16:30,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 03:16:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:30,417 INFO L225 Difference]: With dead ends: 44 [2018-11-23 03:16:30,418 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 03:16:30,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:16:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 03:16:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 03:16:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:16:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 03:16:30,426 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 03:16:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:30,427 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 03:16:30,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:16:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 03:16:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:16:30,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:30,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:30,428 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:30,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 03:16:30,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:30,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:30,809 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 03:16:30,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:16:30,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:16:30,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:30,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:16:30,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 03:16:30,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:30,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:30,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 03:16:30,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-23 03:16:30,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 03:16:30,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:30,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:30,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:30,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 03:16:31,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 03:16:31,051 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:16:31,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 03:16:31,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:16:31,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,075 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-23 03:16:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:16:31,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:16:31,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-23 03:16:31,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 03:16:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 03:16:31,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 03:16:31,127 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 20 states. [2018-11-23 03:16:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:31,604 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 03:16:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 03:16:31,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-11-23 03:16:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:31,606 INFO L225 Difference]: With dead ends: 57 [2018-11-23 03:16:31,606 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 03:16:31,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-11-23 03:16:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 03:16:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-11-23 03:16:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 03:16:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 03:16:31,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2018-11-23 03:16:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:31,612 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 03:16:31,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 03:16:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 03:16:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:16:31,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:31,613 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:31,614 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:31,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:31,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2018-11-23 03:16:31,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:31,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:31,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:31,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:31,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:16:31,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:16:31,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:16:31,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:16:31,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:16:31,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:16:31,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:16:31,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 03:16:31,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:31,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-23 03:16:32,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 03:16:32,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 03:16:32,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 03:16:32,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 03:16:32,142 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:16:32,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 03:16:32,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:16:32,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:32,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:3 [2018-11-23 03:16:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:16:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:16:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-11-23 03:16:32,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 03:16:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 03:16:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-23 03:16:32,179 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 23 states. [2018-11-23 03:16:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:32,814 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 03:16:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 03:16:32,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 03:16:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:32,817 INFO L225 Difference]: With dead ends: 99 [2018-11-23 03:16:32,817 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 03:16:32,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=1369, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 03:16:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 03:16:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 03:16:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 03:16:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-23 03:16:32,828 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 23 [2018-11-23 03:16:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:32,829 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-23 03:16:32,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 03:16:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-23 03:16:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:16:32,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:32,829 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:32,829 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:32,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash -96694823, now seen corresponding path program 1 times [2018-11-23 03:16:32,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:32,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:32,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:32,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:16:32,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:16:32,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:16:32,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:16:32,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:32,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:16:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:16:32,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:16:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 03:16:32,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:16:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:16:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:16:32,969 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 11 states. [2018-11-23 03:16:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:33,061 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-23 03:16:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 03:16:33,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 03:16:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:33,062 INFO L225 Difference]: With dead ends: 82 [2018-11-23 03:16:33,062 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 03:16:33,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-23 03:16:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 03:16:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-23 03:16:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 03:16:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 03:16:33,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 27 [2018-11-23 03:16:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:33,070 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 03:16:33,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:16:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 03:16:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:16:33,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:33,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:33,071 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:33,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2018-11-23 03:16:33,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:33,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:16:33,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:16:33,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b030cc-c832-4a93-88a9-322fd9036e75/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:16:33,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:16:33,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 03:16:33,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:16:33,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:16:33,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 03:16:33,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 03:16:33,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 03:16:33,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 03:16:33,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 03:16:33,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-23 03:16:33,659 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:16:33,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 03:16:33,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:16:33,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:16:33,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-23 03:16:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 03:16:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:16:33,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2018-11-23 03:16:33,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 03:16:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 03:16:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-11-23 03:16:33,695 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 29 states. [2018-11-23 03:16:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:35,139 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 03:16:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 03:16:35,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2018-11-23 03:16:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:35,141 INFO L225 Difference]: With dead ends: 91 [2018-11-23 03:16:35,141 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 03:16:35,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=694, Invalid=3212, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 03:16:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 03:16:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2018-11-23 03:16:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 03:16:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-23 03:16:35,153 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 27 [2018-11-23 03:16:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:35,154 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-23 03:16:35,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 03:16:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 03:16:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 03:16:35,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:35,155 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:35,155 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:35,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash 60600405, now seen corresponding path program 2 times [2018-11-23 03:16:35,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:16:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:16:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:35,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:16:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:16:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:16:35,204 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6, |#NULL.offset|=3, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6, |old(#NULL.offset)|=3] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0);havoc ~cont~0;havoc ~i~0;havoc ~j~0;~cont~0 := 0;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1);havoc #t~nondet2; VAL [main_~cont~0=0, main_~i~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 < ~MAX~0); VAL [main_~cont~0=0, main_~i~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1);~j~0 := 0;~i~0 := ~MAX~0 - 1; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 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=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] 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=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int MAX = __VERIFIER_nondet_uint(); [L14] char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L18] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 >= 0);call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1);call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1);havoc #t~mem4;#t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := #t~post3 - 1;havoc #t~post3; VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !(~i~0 >= 0); VAL [main_~cont~0=0, main_~i~0=(- 1), main_~j~0=2, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] ~j~0 := ~MAX~0 - 1;~i~0 := 0; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #67#return; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=1, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=1, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7;#t~post9 := ~j~0;~j~0 := #t~post9 - 1;havoc #t~post9; VAL [main_~cont~0=0, main_~i~0=0, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] assume !!(~i~0 < ~MAX~0);call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1);call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [main_~cont~0=0, main_~i~0=1, main_~j~0=0, main_~MAX~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=1, |main_~#str1~0.base|=4, |main_~#str1~0.offset|=0, |main_~#str2~0.base|=5, |main_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 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=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] 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=6, #NULL.offset=3, old(#NULL.base)=6, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc(~MAX~0); [L14] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] assume !!(~i~0 < ~MAX~0); [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] call write~int(#t~nondet2, ~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] assume !(~i~0 < ~MAX~0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] call write~int(0, ~#str1~0.base, ~#str1~0.offset + (~MAX~0 - 1), 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] assume !!(~i~0 >= 0); [L26] call #t~mem4 := read~int(~#str1~0.base, ~#str1~0.offset, 1); [L26] call write~int(#t~mem4, ~#str2~0.base, ~#str2~0.offset + ~j~0, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] assume !(~i~0 >= 0); VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] assume !!(~i~0 < ~MAX~0); [L32] call #t~mem7 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0, 1); [L32] call #t~mem8 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0.base=4, ~#str1~0.offset=0, ~#str2~0.base=5, ~#str2~0.offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=6, #NULL!offset=3, old(#NULL!base)=6, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~MAX~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L13] havoc #t~nondet0; [L14] FCALL call ~#str1~0 := #Ultimate.alloc(~MAX~0); [L14] FCALL call ~#str2~0 := #Ultimate.alloc(~MAX~0); [L15] havoc ~cont~0; [L15] havoc ~i~0; [L15] havoc ~j~0; [L16] ~cont~0 := 0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18-L20] COND FALSE !(!(~i~0 < ~MAX~0)) [L19] assume -128 <= #t~nondet2 && #t~nondet2 <= 127; [L19] FCALL call write~int(#t~nondet2, { base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~MAX~0=2] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L18-L20] COND TRUE !(~i~0 < ~MAX~0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=2, ~MAX~0=2] [L21] FCALL call write~int(0, { base: ~#str1~0!base, offset: ~#str1~0!offset + (~MAX~0 - 1) }, 1); [L23] ~j~0 := 0; [L25] ~i~0 := ~MAX~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=1, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L25-L28] COND FALSE !(!(~i~0 >= 0)) [L26] FCALL call #t~mem4 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset }, 1); [L26] FCALL call write~int(#t~mem4, { base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); [L26] havoc #t~mem4; [L27] #t~post5 := ~j~0; [L27] ~j~0 := 1 + #t~post5; [L27] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=2, ~MAX~0=2] [L25] #t~post3 := ~i~0; [L25] ~i~0 := #t~post3 - 1; [L25] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L25-L28] COND TRUE !(~i~0 >= 0) VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=-1, ~j~0=2, ~MAX~0=2] [L30] ~j~0 := ~MAX~0 - 1; [L31] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L32] RET call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=1, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=1, ~MAX~0=2] [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] #t~post9 := ~j~0; [L33] ~j~0 := #t~post9 - 1; [L33] havoc #t~post9; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=0, ~j~0=0, ~MAX~0=2] [L31] #t~post6 := ~i~0; [L31] ~i~0 := 1 + #t~post6; [L31] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L31-L34] COND FALSE !(!(~i~0 < ~MAX~0)) [L32] FCALL call #t~mem7 := read~int({ base: ~#str1~0!base, offset: ~#str1~0!offset + ~i~0 }, 1); [L32] FCALL call #t~mem8 := read~int({ base: ~#str2~0!base, offset: ~#str2~0!offset + ~j~0 }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=1, ~#str1~0!base=4, ~#str1~0!offset=0, ~#str2~0!base=5, ~#str2~0!offset=0, ~cont~0=0, ~i~0=1, ~j~0=0, ~MAX~0=2] [L32] CALL call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] int MAX = __VERIFIER_nondet_uint(); [L14] char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L18] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR str1[0] [L26] str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i